{"type":"ScholarlyArticle","title":"An Exact Algorithm for Maximum k-Plexes in Massive Graphs","authors":[{"name":"Jian Gao","slug":"jian-gao","given":"Jian","family":"Gao","affiliation":"College of Information Science and Technology , Dalian Maritime University , China; School of Computer Science and Information Technology , Northeast Normal University , China"},{"name":"Jiejiang Chen","slug":"jiejiang-chen","given":"Jiejiang","family":"Chen","affiliation":"School of Computer Science and Information Technology , Northeast Normal University , China"},{"name":"Minghao Yin","slug":"minghao-yin","given":"Minghao","family":"Yin","affiliation":"School of Computer Science and Information Technology , Northeast Normal University , China"},{"name":"Rong Chen","slug":"rong-chen","given":"Rong","family":"Chen","affiliation":"College of Information Science and Technology , Dalian Maritime University , China"},{"name":"Yiyuan Wang","slug":"yiyuan-wang","given":"Yiyuan","family":"Wang","affiliation":"School of Computer Science and Information Technology , Northeast Normal University , China"}],"abstract":"The maximum k-plex, a generalization of maximum clique, is used to cope with a great number of real-world problems. The aim of this paper is to propose a novel exact k-plex algorithm that can deal with large-scaled graphs with millions of vertices and edges. Specifically, we first propose several new graph reduction methods through a careful analyzing of structures of induced subgraphs. Afterwards, we present a preprocessing method to simplify initial graphs. Additionally, we present a branch-and-bound algorithm integrating the reduction methods as well as a new dynamic vertex selection mechanism. We perform intensive experiments to evaluate our algorithm, and show that the proposed strategies are effective and our algorithm outperforms state-of-the-art algorithms, especially for real-world massive graphs.","doi":"10.24963/ijcai.2018/201","url":"https://ijcai.org/proceedings/2018/201","pdf":"https://ijcai.org/proceedings/2018/0201.pdf","markdown":"https://ijcai.org/proceedings/2018/201.md","bibtex":"https://ijcai.org/proceedings/2018/bibtex/201","volume":{"slug":"2018","title":"Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2018","url":"https://ijcai.org/proceedings/2018/","year":2018,"location":"Stockholm","dates":"13-19 July 2018","editors":"Jérôme Lang","isbn":"978-0-9992411-2-7","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2018"},"section":"Heuristic Search and Game Playing","track":"Main track","number":201,"pages":{"first":1449,"last":1455},"keywords":["Heuristic Search and Game Playing: Heuristic Search","Heuristic Search and Game Playing: Combinatorial Search and Optimisation"],"videos":[],"references":[{"position":1,"raw":"[Balasundaram et al., 2011] Balabhaskar Balasundaram, Sergiy Butenko, and Illya V Hicks. Clique relaxations in social network analysis: The maximum k-plex problem. Operations Research, 59(1):133-142, 2011.","title":"Clique relaxations in social network analysis: The maximum k-plex problem","authors":"Balasundaram","year":"2011","venue":"Operations Research","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Batsyn et al., 2014] Mikhail Batsyn, Boris Goldengorin, Evgeny Maslov, and Panos M. Pardalos. Improvements to MCS algorithm for the maximum clique problem. J. Comb. Optim., 27(2):397-416, 2014.","title":"Improvements to MCS algorithm for the maximum clique problem","authors":"Mikhail Batsyn, Boris Goldengorin, Evgeny Maslov, Panos M Pardalos","year":"2014","venue":"J. Comb. Optim","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Berlowitz et al., 2015] Devora Berlowitz, Sara Cohen, and Benny Kimelfeld. Efficient enumeration of maximal k- plexes. In Timos K. Sellis, Susan B. Davidson, and Zachary G. Ives, editors, Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data, Melbourne, Victoria, Australia, May 31 -June 4, 2015, pages 431-444. ACM, 2015.","title":"Efficient enumeration of maximal kplexes","authors":"Devora Berlowitz, Sara Cohen, Benny Kimelfeld","year":"2015","venue":"Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Cai and Lin, 2016] Shaowei Cai and Jinkun Lin. Fast solv- ing maximum weight clique problem in massive graphs. In Proceedings of the Twenty-Fifth International Joint Con- ference on Artificial Intelligence, New York, NY, USA, 9-15 July 2016, pages 568-574. IJCAI/AAAI Press, 2016.","title":"Fast solving maximum weight clique problem in massive graphs","authors":"Lin ; ] Shaowei Cai, Jinkun Cai, Lin","year":"2016","venue":"Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2016/87"},{"position":5,"raw":"[Cai, 2015] Shaowei Cai. Balance between complexity and quality: Local search for minimum vertex cover in mas- sive graphs. In Proceedings of the Twenty-Fourth Inter- national Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015, pages 747-753. AAAI Press, 2015.","title":"Balance between complexity and quality: Local search for minimum vertex cover in massive graphs","authors":"Shaowei Cai, Cai","year":"2015","venue":"Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015","doi":null,"url":null,"internal_url":"/proceedings/2015/111"},{"position":6,"raw":"[Conte et al., 2016] Alessio Conte, Roberto De Virgilio, An- tonio Maccioni, Maurizio Patrignani, and Riccardo Tor- lone. Finding all maximal cliques in very large social networks. In Proceedings of the 19th International Con- ference on Extending Database Technology, Bordeaux, France, March 15-16, 2016., pages 173-184, 2016.","title":"Finding all maximal cliques in very large social networks","authors":"Alessio Conte, Roberto De Virgilio, Antonio Maccioni, Maurizio Patrignani, Riccardo Torlone","year":"2016","venue":"Proceedings of the 19th International Conference on Extending Database Technology","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Conte et al., 2017] Alessio Conte, Donatella Firmani, Cate- rina Mordente, Maurizio Patrignani, and Riccardo Tor- lone. Fast enumeration of large k-plexes. In Proceed- ings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Halifax, NS, Canada, August 13 -17, 2017, pages 115-124, 2017.","title":"Fast enumeration of large k-plexes","authors":"Alessio Conte, Donatella Firmani, Caterina Mordente, Maurizio Patrignani, Riccardo Torlone","year":"2017","venue":"Proceedings of the 23rd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Jiang et al., 2017] Hua Jiang, Chu-Min Li, and Felip Manyà. An exact algorithm for the maximum weight clique problem in large graphs. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9, 2017, San Francisco, California, USA., pages 830-838, 2017.","title":"An exact algorithm for the maximum weight clique problem in large graphs","authors":"Hua Jiang, Chu-Min Li, Felip Manyà","year":"2017","venue":"Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Lakhlef, 2015] Hicham Lakhlef. A multi-level clustering scheme based on cliques and clusters for wireless sensor networks. Computers & Electrical Engineering, 48:436- 450, 2015.","title":"A multi-level clustering scheme based on cliques and clusters for wireless sensor networks","authors":"Hicham Lakhlef","year":"2015","venue":"Computers & Electrical Engineering","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Lin et al., 2017] Jinkun Lin, Shaowei Cai, Chuan Luo, and Kaile Su. A reduction based method for coloring very large graphs. In Proceedings of the Twenty-Sixth Inter- national Joint Conference on Artificial Intelligence, Mel- bourne, Australia, August 19-25, 2017, pages 517-523, 2017.","title":"A reduction based method for coloring very large graphs","authors":"Lin","year":"2017","venue":"Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":"/proceedings/2017/73"},{"position":11,"raw":"[Miao and Balasundaram, 2017] Zhuqi Miao and Balab- haskar Balasundaram. Approaches for finding cohesive subgroups in large-scale social networks via maximum k- plex detection. Networks, 69(4):388-407, 2017.","title":"Zhuqi Miao and Balabhaskar Balasundaram. Approaches for finding cohesive subgroups in large-scale social networks via maximum kplex detection","authors":"Balasundaram Miao","year":"2017","venue":"Networks","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Moser et al., 2012] Hannes Moser, Rolf Niedermeier, and Manuel Sorge. Exact combinatorial algorithms and ex- periments for finding maximum k-plexes. Journal of com- binatorial optimization, 24(3):347-373, 2012.","title":"Exact combinatorial algorithms and experiments for finding maximum k-plexes","authors":"Hannes Moser, Rolf Niedermeier, Manuel Sorge","year":"2012","venue":"Journal of combinatorial optimization","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Rossi and Ahmed, 2014] Ryan A Rossi and Nesreen K Ahmed. Coloring large complex networks. Social Net- work Analysis and Mining, 4(1):228, 2014.","title":"Coloring large complex networks","authors":"A Ryan, Nesreen K Rossi, Ahmed","year":"2014","venue":"Social Network Analysis and Mining","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Rossi and Ahmed, 2015] Ryan A. Rossi and Nesreen K. Ahmed. The network data repository with interactive graph analytics and visualization. In Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, January 25-30, 2015, Austin, Texas, USA., pages 4292- 4293, 2015.","title":"The network data repository with interactive graph analytics and visualization","authors":"Ryan A Rossi, Nesreen K Ahmed","year":"2015","venue":"Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Rossi et al., 2014] Ryan A. Rossi, David F. Gleich, Asse- faw Hadish Gebremedhin, and Md. Mostofa Ali Patwary. Fast maximum clique algorithms for large graphs. In Chin- Wan Chung, Andrei Z. Broder, Kyuseok Shim, and Torsten Suel, editors, 23rd International World Wide Web Confer- ence, WWW '14, Seoul, Republic of Korea, April 7-11, 2014, Companion Volume, pages 365-366. ACM, 2014.","title":"Fast maximum clique algorithms for large graphs","authors":"Ryan A Rossi, David F Gleich, Assefaw Hadish Gebremedhin, Md Mostofa, Ali Patwary","year":"2014","venue":"International World Wide Web Conference, WWW '14","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Seidman and Foster, 1978] Stephen B Seidman and Brian L Foster. A graph-theoretic generalization of the clique con- cept. Journal of Mathematical sociology, 6(1):139-154, 1978.","title":"A graph-theoretic generalization of the clique concept","authors":"B Stephen, Brian L Seidman, Foster","year":"1978","venue":"Journal of Mathematical sociology","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Xiao et al., 2017] Mingyu Xiao, Weibo Lin, Yuanshun Dai, and Yifeng Zeng. A fast algorithm to compute maxi- mum k-plexes in social network analysis. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelli- gence, February 4-9, 2017, San Francisco, California, US- A., pages 919-925, 2017.","title":"A fast algorithm to compute maximum k-plexes in social network analysis","authors":"Mingyu Xiao, Weibo Lin, Yuanshun Dai, Yifeng Zeng","year":"2017","venue":"Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Zhou and Hao, 2017] Yi Zhou and Jin-Kao Hao. Frequency-driven tabu search for the maximum s- plex problem. Computers & Operations Research, 86:65-78, 2017.","title":"Frequency-driven tabu search for the maximum splex problem","authors":"Hao ; ] Yi Zhou, Jin-Kao Zhou, Hao","year":"2017","venue":"Computers & Operations Research","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}