{"type":"ScholarlyArticle","title":"K-Core Maximization: An Edge Addition Approach","authors":[{"name":"Zhongxin Zhou","slug":"zhongxin-zhou","given":"Zhongxin","family":"Zhou","affiliation":"Guangzhou University , Guangzhou , China; East China Normal University , Shanghai , China; Zhejiang Lab , Hangzhou , China"},{"name":"Fan Zhang","slug":"fan-zhang","given":"Fan","family":"Zhang","affiliation":"Guangzhou University , Guangzhou , China"},{"name":"Xuemin Lin","slug":"xuemin-lin","given":"Xuemin","family":"Lin","affiliation":"East China Normal University , Shanghai , China; University of New South Wales , Sydney , Australia; Zhejiang Lab , Hangzhou , China"},{"name":"Wenjie Zhang","slug":"wenjie-zhang","given":"Wenjie","family":"Zhang","affiliation":"University of New South Wales , Sydney , Australia"},{"name":"Chen Chen","slug":"chen-chen","given":"Chen","family":"Chen","affiliation":"East China Normal University , Shanghai , China"}],"abstract":"A popular model to measure the stability of a network is k-core - the maximal induced subgraph in which every vertex has at least k neighbors. Many studies maximize the number of vertices in k-core to improve the stability of a network. In this paper, we study the edge k-core problem: Given a graph G, an integer k and a budget b, add b edges to non-adjacent vertex pairs in G such that the k-core is maximized. We prove the problem is NP-hard and APX-hard. A heuristic algorithm is proposed on general graphs with effective optimization techniques. Comprehensive experiments on 9 real-life datasets demonstrate the effectiveness and the efficiency of our proposed methods.","doi":"10.24963/ijcai.2019/676","url":"https://ijcai.org/proceedings/2019/676","pdf":"https://ijcai.org/proceedings/2019/0676.pdf","markdown":"https://ijcai.org/proceedings/2019/676.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/676","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Multidisciplinary Topics and Applications","track":"Main track","number":676,"pages":{"first":4867,"last":4873},"keywords":["Multidisciplinary Topics and Applications: Social Sciences","Multidisciplinary Topics and Applications: Databases"],"videos":[],"references":[{"position":1,"raw":"[Batagelj and Zaversnik, 2003] Vladimir Batagelj and Mat- jaz Zaversnik. An o(m) algorithm for cores decomposition of networks. CoRR, cs.DS/0310049, 2003.","title":"An o(m) algorithm for cores decomposition of networks","authors":"Vladimir Batagelj, Matjaz Zaversnik","year":"2003","venue":null,"doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bhawalkar et al., 2015] Kshipra Bhawalkar, Jon M. Klein- berg, Kevin Lewi, Tim Roughgarden, and Aneesh Sharma. Preventing unraveling in social networks: The anchored k- core problem. SIAM J. Discrete Math., 29(3):1452-1475, 2015.","title":"Preventing unraveling in social networks: The anchored kcore problem","authors":"Kshipra Bhawalkar, Jon M Kleinberg, Kevin Lewi, Tim Roughgarden, Aneesh Sharma","year":"2015","venue":"SIAM J. Discrete Math","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Cheema et al., 2010] Muhammad Aamir Cheema, Ljiljana Brankovic, Xuemin Lin, Wenjie Zhang, and Wei Wang. Multi-guarded safe zone: An effective technique to mon- itor moving circular range queries. In ICDE, pages 189- 200, 2010.","title":"Multi-guarded safe zone: An effective technique to monitor moving circular range queries","authors":"Muhammad Aamir, Cheema, Ljiljana Brankovic, Xuemin Lin, Wenjie Zhang, Wei Wang","year":"2010","venue":"ICDE","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Chitnis and Talmon, 2018] Rajesh Chitnis and Nimrod Tal- mon. Can we create large k-cores by adding few edges? In CSR, pages 78-89, 2018.","title":"Can we create large k-cores by adding few edges? In CSR","authors":"Rajesh Chitnis, Nimrod Talmon","year":"2018","venue":null,"doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Chitnis et al., 2013] Rajesh Hemant Chitnis, Fedor V. Fomin, and Petr A. Golovach. Preventing unraveling in social networks gets harder. In AAAI, 2013.","title":"Preventing unraveling in social networks gets harder","authors":"Rajesh Hemant Chitnis, Fedor V Fomin, Petr A Golovach","year":"2013","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Feige, 1998] Uriel Feige. A threshold of ln n for approxi- mating set cover. J. ACM, 45(4):634-652, 1998.","title":"A threshold of ln n for approximating set cover","authors":"Uriel Feige","year":"1998","venue":"J. ACM","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Kapron et al., 2011] Bruce M. Kapron, Gautam Srivastava, and S. Venkatesh. Social network anonymization via edge addition. In ASONAM, pages 155-162, 2011.","title":"Social network anonymization via edge addition","authors":"Bruce M Kapron, Gautam Srivastava, S Venkatesh","year":"2011","venue":"ASONAM","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Karp, 1972] Richard M. Karp. Reducibility among combi- natorial problems. In Complexity of Computer Computa- tions, pages 85-103, 1972.","title":"Reducibility among combinatorial problems","authors":"Richard M Karp","year":"1972","venue":"Complexity of Computer Computations","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Kitsak et al., 2010] Maksim Kitsak, Lazaros K Gallos, Shlomo Havlin, Fredrik Liljeros, Lev Muchnik, H Eu- gene Stanley, and Hernán A Makse. Identification of in- fluential spreaders in complex networks. Nature physics, 6(11):888-893, 2010.","title":"Identification of influential spreaders in complex networks","authors":"Maksim Kitsak, K Lazaros, Shlomo Gallos, Fredrik Havlin, Lev Liljeros, Eugene Muchnik, Hernán A Stanley, Makse","year":"2010","venue":"Nature physics","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Lai et al., 2005] Yung-Ling Lai, Chang-Sin Tian, and Ting- Chun Ko. Edge addition number of cartesian product of paths and cycles. Electronic Notes in Discrete Mathemat- ics, 22:439-444, 2005.","title":"Edge addition number of cartesian product of paths and cycles","authors":"Yung-Ling Lai, Chang-Sin Tian, Ting-Chun Ko","year":"2005","venue":"Electronic Notes in Discrete Mathematics","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Luce and Perry, 1949] R Duncan Luce and Albert D Per- ry. A method of matrix analysis of group structure. Psy- chometrika, 14(2):95-116, 1949.","title":"A method of matrix analysis of group structure","authors":"Duncan Luce, Albert D Perry","year":"1949","venue":"Psychometrika","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Luo et al., 2008] Yi Luo, Wei Wang, and Xuemin Lin. S- PARK: A keyword search engine on relational databases. In ICDE, pages 1552-1555, 2008.","title":"S-PARK: A keyword search engine on relational databases","authors":"Yi Luo, Wei Wang, Xuemin Lin","year":"2008","venue":"ICDE","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Luo et al., 2011] Yi Luo, Wei Wang, Xuemin Lin, Xiaofang Zhou, Jianmin Wang, and Keqiu Li. SPARK2: top-k key- word query in relational databases. IEEE Trans. Knowl. Data Eng., 23(12):1763-1780, 2011.","title":"SPARK2: top-k keyword query in relational databases","authors":"Yi Luo, Wei Wang, Xuemin Lin, Xiaofang Zhou, Jianmin Wang, Keqiu Li","year":"2011","venue":"IEEE Trans. Knowl. Data Eng","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Malliaros and Vazirgiannis, 2013] Fragkiskos D. Malliaros and Michalis Vazirgiannis. To stay or not to stay: modeling engagement dynamics in social graphs. In CIKM, pages 469-478, 2013.","title":"To stay or not to stay: modeling engagement dynamics in social graphs","authors":"D Fragkiskos, Michalis Malliaros, Vazirgiannis","year":"2013","venue":"CIKM","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Medya et al., 2019] Sourav Medya, Tiyani Ma, Arlei Silva, and Ambuj K. Singh. K-core minimization: A game theo- retic approach. CoRR, abs/1901.02166, 2019.","title":"K-core minimization: A game theoretic approach","authors":"Sourav Medya, Tiyani Ma, Arlei Silva, Ambuj K Singh","year":"2019","venue":null,"doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Morone et al., 2019] Flaviano Morone, Gino Del Ferraro, and Hernán A Makse. The k-core as a predictor of struc- tural collapse in mutualistic ecosystems. Nature Physics, 15(1):95, 2019.","title":"The k-core as a predictor of structural collapse in mutualistic ecosystems","authors":"Flaviano Morone, Gino Del Ferraro, Hernán A Makse","year":"2019","venue":"Nature Physics","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Natanzon et al., 2001] Assaf Natanzon, Ron Shamir, and Roded Sharan. Complexity classification of some edge modification problems. Discrete Applied Mathematics, 113(1):109-128, 2001.","title":"Complexity classification of some edge modification problems","authors":"Assaf Natanzon, Ron Shamir, Roded Sharan","year":"2001","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Seidman, 1983] Stephen B Seidman. Network structure and minimum degree. Social networks, 5(3):269-287, 1983.","title":"Network structure and minimum degree","authors":"Stephen B Seidman","year":"1983","venue":"Social networks","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Suady and Najim, 2014] Suaad AA Suady and Alaa A Na- jim. On edge-addition problem. Journal of College of Education for Pure Science, 4(1):26-36, 2014.","title":"Suaad AA Suady and Alaa A Najim","authors":"Najim Suady","year":"2014","venue":"Journal of College of Education for Pure Science","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Ugander et al., 2012] Johan Ugander, Lars Backstrom, Cameron Marlow, and Jon Kleinberg. Structural diversity in social contagion. PNAS, 109(16):5962-5966, 2012.","title":"Structural diversity in social contagion","authors":"Johan Ugander, Lars Backstrom, Cameron Marlow, Jon Kleinberg","year":"2012","venue":"PNAS","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Wu et al., 2013] Shaomei Wu, Atish Das Sarma, Alex Fab- rikant, Silvio Lattanzi, and Andrew Tomkins. Arrival and departure dynamics in social networks. In WSDM, pages 233-242, 2013.","title":"Arrival and departure dynamics in social networks","authors":"Wu","year":"2013","venue":"WSDM","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Zhang et al., 2017a] Fan Zhang, Wenjie Zhang, Ying Zhang, Lu Qin, and Xuemin Lin. OLAK: an efficient al- gorithm to prevent unraveling in social networks. PVLDB, 10(6):649-660, 2017.","title":"OLAK: an efficient algorithm to prevent unraveling in social networks","authors":"Zhang","year":"2017","venue":"PVLDB","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Zhang et al., 2017b] Fan Zhang, Ying Zhang, Lu Qin, Wen- jie Zhang, and Xuemin Lin. Finding critical users for so- cial network engagement: The collapsed k-core problem. In AAAI, pages 245-251, 2017.","title":"Finding critical users for social network engagement: The collapsed k-core problem","authors":"Zhang","year":"2017","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Zhang et al., 2017c] Yikai Zhang, Jeffrey Xu Yu, Ying Zhang, and Lu Qin. A fast order-based approach for core maintenance. In ICDE, pages 337-348, 2017.","title":"A fast order-based approach for core maintenance","authors":"Zhang","year":"2017","venue":"ICDE","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Zhang et al., 2018a] Fan Zhang, Long Yuan, Ying Zhang, Lu Qin, Xuemin Lin, and Alexander Zhou. Discovering strong communities with user engagement and tie strength. In DASFAA, pages 425-441, 2018.","title":"Discovering strong communities with user engagement and tie strength","authors":"Zhang","year":"2018","venue":"DASFAA","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Zhang et al., 2018b] Fan Zhang, Ying Zhang, Lu Qin, Wen- jie Zhang, and Xuemin Lin. Efficiently reinforcing social networks over user engagement and tie strength. In ICDE, pages 557-568, 2018.","title":"Efficiently reinforcing social networks over user engagement and tie strength","authors":"Zhang","year":"2018","venue":"ICDE","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Zhu et al., 2018] Weijie Zhu, Chen Chen, Xiaoyang Wang, and Xuemin Lin. K-core minimization: An edge manipu- lation approach. In CIKM, pages 1667-1670, 2018.","title":"K-core minimization: An edge manipulation approach","authors":"Weijie Zhu, Chen Chen, Xiaoyang Wang, Xuemin Lin","year":"2018","venue":"CIKM","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}