{"type":"ScholarlyArticle","title":"Nukplex: An Efficient Local Search Algorithm for Maximum K-Plex Problem","authors":[{"name":"Rui Sun","slug":"rui-sun","given":"Rui","family":"Sun","affiliation":"School of Computer Science and Information Technology , Northeast Normal University , China"},{"name":"Yiyuan Wang","slug":"yiyuan-wang","given":"Yiyuan","family":"Wang","affiliation":"School of Computer Science and Information Technology , Northeast Normal University , China; Key Laboratory of Applied Statistics of MOE , Northeast Normal University , Changchun , China"},{"name":"Shimao Wang","slug":"shimao-wang","given":"Shimao","family":"Wang","affiliation":"School of Computer Science and Information Technology , Northeast Normal University , China"},{"name":"Hui Li","slug":"hui-li","given":"Hui","family":"Li","affiliation":"School of Computer Science and Information Technology , Northeast Normal University , China"},{"name":"Ximing Li","slug":"ximing-li","given":"Ximing","family":"Li","affiliation":"College of Computer Science and Technology , Jilin University , China; Key Laboratory of Symbolic Computation and Knowledge Engineering of MOE , Jilin University , China"},{"name":"Minghao Yin","slug":"minghao-yin","given":"Minghao","family":"Yin","affiliation":"School of Computer Science and Information Technology , Northeast Normal University , China; Key Laboratory of Applied Statistics of MOE , Northeast Normal University , Changchun , China"}],"abstract":"The maximum k-plex problem (MKPP) is an significant relaxation version of the maximum clique problem with extensive applications. Recently, lots of researchers have proposed many heuristic algorithms based on various methods to solve the MKPP. In this work, to further improve the performance of solving the MKPP, we propose an efficient local search algorithm based on three main ideas. First, we propose a relaxed bounded configuration checking strategy that considers two kinds of historical searching information to relax the restricted  strength of configuration checking and the forbidden condition of candidate vertices for the operation Add, respectively. Second, we present a novel solution information-based vertex selection strategy based on two kinds of solution information to select high-quality candidate vertices. Third, we define the solution core and then introduce a core-based perturbation strategy to help the algorithm jump out of local optima.\r\nThe experimental results show that the proposed algorithm significantly outperforms the state-of-the-art MKPP algorithms in almost all the instances.","doi":"10.24963/ijcai.2024/777","url":"https://ijcai.org/proceedings/2024/777","pdf":"https://ijcai.org/proceedings/2024/0777.pdf","markdown":"https://ijcai.org/proceedings/2024/777.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/777","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Search","track":"Main Track","number":777,"pages":{"first":7029,"last":7037},"keywords":["Search: S: Local search","Search: S: Heuristic search"],"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":"[Balasundaram, 2007] Balabhaskar Balasundaram. Graph theoretic generalizations of clique: Optimization and ex- tensions. Texas A&M University, 2007.","title":"Balabhaskar Balasundaram. Graph theoretic generalizations of clique: Optimization and extensions","authors":"Balasundaram","year":"2007","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Cai et al., 2011] Shaowei Cai, Kaile Su, and Abdul Sat- tar. Local search with edge weighting and configuration checking heuristics for minimum vertex cover. Artificial Intelligence, 175(9-10):1672-1696, 2011.","title":"Local search with edge weighting and configuration checking heuristics for minimum vertex cover","authors":"Shaowei Cai, Kaile Su, Abdul Sattar","year":"2011","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Chang et al., 2022] Lijun Chang, Mouyi Xu, and Darren Strash. Efficient maximum k-plex computation over large sparse graphs. Proceedings of the VLDB Endowment, 16(2):127-139, 2022.","title":"Efficient maximum k-plex computation over large sparse graphs","authors":"Lijun Chang, Mouyi Xu, Darren Strash","year":"2022","venue":"Proceedings of the VLDB Endowment","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Chen et al., 2020] Peilin Chen, Hai Wan, Shaowei Cai, Jia Li, and Haicheng Chen. Local search with dynamic- threshold configuration checking and incremental neigh- borhood updating for maximum k-plex problem. In AAAI, pages 2343-2350, 2020.","title":"Local search with dynamicthreshold configuration checking and incremental neighborhood updating for maximum k-plex problem","authors":"Peilin Chen, Hai Wan, Shaowei Cai, Jia Li, Haicheng Chen","year":"2020","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Chen et al., 2021] Jiejiang Chen, Shaowei Cai, Shiwei Pan, Yiyuan Wang, Qingwei Lin, Mengyu Zhao, and Minghao Yin. Nuqclq: An effective local search algorithm for maxi- mum quasi-clique problem. In AAAI, pages 12258-12266, 2021.","title":"Nuqclq: An effective local search algorithm for maximum quasi-clique problem","authors":"Chen","year":"2021","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Chen et al., 2022] Jiejiang Chen, Yiyuan Wang, Shaowei Cai, Minghao Yin, Yupeng Zhou, and Jieyu Wu. Nukcp: An improved local search algorithm for maximum k-club problem. In AAAI, pages 10146-10155, 2022.","title":"Nukcp: An improved local search algorithm for maximum k-club problem","authors":"Chen","year":"2022","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Chen et al., 2023] Jiejiang Chen, Shaowei Cai, Yiyuan Wang, Wenhao Xu, Jia Ji, and Minghao Yin. Improved local search for the minimum weight dominating set prob- lem in massive graphs by using a deep optimization mech- anism. Artificial Intelligence, 314:103819, 2023.","title":"Improved local search for the minimum weight dominating set problem in massive graphs by using a deep optimization mechanism","authors":"Jiejiang Chen, Shaowei Cai, Yiyuan Wang, Wenhao Xu, Jia Ji, Minghao Yin","year":"2023","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Conte et al., 2018] Alessio Conte, Tiziano De Matteis, Daniele De Sensi, Roberto Grossi, Andrea Marino, and Luca Versari. D2k: scalable community detection in mas- sive networks via small-diameter k-plexes. In SIGKDD, pages 1272-1281, 2018.","title":"D2k: scalable community detection in massive networks via small-diameter k-plexes","authors":"Alessio Conte, Tiziano De Matteis, Daniele De Sensi, Roberto Grossi, Andrea Marino, Luca Versari","year":"2018","venue":"SIGKDD","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Dolan and Moré, 2002] Elizabeth D. Dolan and Jorge J. Moré. Benchmarking optimization software with perfor- mance profiles. Mathematical Programming, 91:201-213, 2002.","title":"Benchmarking optimization software with performance profiles","authors":"Elizabeth D Dolan, Jorge J Moré","year":"2002","venue":"Mathematical Programming","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Gao et al., 2018] Jian Gao, Jiejiang Chen, Minghao Yin, Rong Chen, and Yiyuan Wang. An exact algorithm for maximum k-plexes in massive graphs. In IJCAI, pages 1449-1455, 2018.","title":"An exact algorithm for maximum k-plexes in massive graphs","authors":"Jian Gao, Jiejiang Chen, Minghao Yin, Rong Chen, Yiyuan Wang","year":"2018","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2018/201"},{"position":12,"raw":"[Glover, 1989] Fred Glover. Tabu search-part i. ORSA Journal on computing, 1(3):190-206, 1989.","title":"Fred Glover. Tabu search-part i","authors":"Glover","year":"1989","venue":"ORSA Journal on computing","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Gschwind et al., 2018] Timo Gschwind, Stefan Irnich, and Isabel Podlinski. Maximum weight relaxed cliques and russian doll search revisited. Discrete Applied Mathemat- ics, 234:131-138, 2018.","title":"Maximum weight relaxed cliques and russian doll search revisited","authors":"Timo Gschwind, Stefan Irnich, Isabel Podlinski","year":"2018","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Gujjula et al., 2014] Krishna Reddy Gujjula, Krishnan Ay- alur Seshadrinathan, and Amirhossein Meisami. A hybrid metaheuristic for the maximum k-plex problem. In Exam- ining Robustness and Vulnerability of Networked Systems, pages 83-92. IOS Press, 2014.","title":"A hybrid metaheuristic for the maximum k-plex problem","authors":"Krishna Reddy Gujjula, Krishnan Ayalur Seshadrinathan, Amirhossein Meisami","year":"2014","venue":"Examining Robustness and Vulnerability of Networked Systems","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Jiang et al., 2021] Hua Jiang, Dongming Zhu, Zhichao Xie, Shaowen Yao, and Zhang-Hua Fu. A new upper bound based on vertex partitioning for the maximum k-plex prob- lem. In IJCAI, pages 1689-1696, 2021.","title":"A new upper bound based on vertex partitioning for the maximum k-plex problem","authors":"Hua Jiang, Dongming Zhu, Zhichao Xie, Shaowen Yao, Zhang-Hua Fu","year":"2021","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2021/233"},{"position":16,"raw":"[Jiang et al., 2023] Hua Jiang, Fusheng Xu, Zhifei Zheng, Bowen Wang, and Wei Zhou. A refined upper bound and inprocessing for the maximum k-plex problem. In IJCAI, pages 5613-5621, 2023.","title":"A refined upper bound and inprocessing for the maximum k-plex problem","authors":"Hua Jiang, Fusheng Xu, Zhifei Zheng, Bowen Wang, Wei Zhou","year":"2023","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2023/623"},{"position":17,"raw":"[Jin et al., 2022] Yan Jin, John H Drake, Kun He, and Una Benlic. Reinforcement learning based coarse-to-fine search for the maximum k-plex problem. Applied Soft Computing, 131:109758, 2022.","title":"Reinforcement learning based coarse-to-fine search for the maximum k-plex problem","authors":"Yan Jin, John H Drake, Kun He, Una Benlic","year":"2022","venue":"Applied Soft Computing","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Johnson and Trick, 1996] David S Johnson and Michael A Trick. Cliques, coloring, and satisfiability: second DI- MACS implementation challenge, October 11-13, 1993, volume 26. American Mathematical Soc., 1996.","title":"Cliques, coloring, and satisfiability: second DI-MACS implementation challenge","authors":"S David, Michael A Johnson, Trick","year":"1993","venue":null,"doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Kondo et al., 2012] Keisuke Kondo, Toshihiro Okubo, et al. Structural estimation and interregional labour migration: Evidence from japan. Technical report, Keio/Kyoto Joint Global COE Program, 2012.","title":"Structural estimation and interregional labour migration: Evidence from japan","authors":"Keisuke Kondo, Toshihiro Okubo","year":"2012","venue":null,"doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[López-Ibáñez et al., 2016] Manuel López-Ibáñez, Jérémie Dubois-Lacoste, Leslie Pérez Cáceres, Mauro Birattari, and Thomas Stützle. The irace package: Iterated racing for automatic algorithm configuration. Operations Research Perspectives, 3:43-58, 2016.","title":"The irace package: Iterated racing for automatic algorithm configuration","authors":"Manuel López-Ibáñez, Jérémie Dubois-Lacoste, Leslie Pérez Cáceres, Mauro Birattari, Thomas Stützle","year":"2016","venue":"Operations Research Perspectives","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[McClosky et al., 2012] Benjamin McClosky, Illya V Hicks, et al. Combinatorial algorithms for the maximum k-plex problem. Journal of combinatorial optimization, 23(1):29, 2012.","title":"Combinatorial algorithms for the maximum k-plex problem","authors":"Benjamin Mcclosky, V Illya, Hicks","year":"2012","venue":"Journal of combinatorial optimization","doi":null,"url":null,"internal_url":null},{"position":22,"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":23,"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: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":24,"raw":"[Pattillo et al., 2013] Jeffrey Pattillo, Nataly Youssef, and Sergiy Butenko. On clique relaxation models in network analysis. European Journal of Operational Research, 226(1):9-18, 2013.","title":"On clique relaxation models in network analysis","authors":"Jeffrey Pattillo, Nataly Youssef, Sergiy Butenko","year":"2013","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Pullan, 2021] Wayne Pullan. Local search for the maximum k-plex problem. Journal of Heuristics, 27(3):303-324, 2021.","title":"Local search for the maximum k-plex problem","authors":"Wayne Pullan","year":"2021","venue":"Journal of Heuristics","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Rossi and Ahmed, 2015] Ryan Rossi and Nesreen Ahmed. The network data repository with interactive graph analyt- ics and visualization. In AAAI, pages 4292-4293, 2015.","title":"The network data repository with interactive graph analytics and visualization","authors":"Ryan Rossi, Nesreen Ahmed","year":"2015","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":27,"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":28,"raw":"[Shahinpour and Butenko, 2013] Shahram Shahinpour and Sergiy Butenko. Algorithms for the maximum k-club problem in graphs. Journal of Combinatorial Optimiza- tion, 26(3):520-554, 2013.","title":"Algorithms for the maximum k-club problem in graphs","authors":"Shahram Shahinpour, Sergiy Butenko","year":"2013","venue":"Journal of Combinatorial Optimization","doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Shirokikh, 2013] Oleg A Shirokikh. Degree-based clique relaxations: theoretical bounds, computational issues, and applications. PhD thesis, University of Florida, 2013.","title":"Degree-based clique relaxations: theoretical bounds, computational issues, and applications","authors":"Oleg A Shirokikh","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Trukhanov et al., 2013] Svyatoslav Trukhanov, Chitra Bal- asubramaniam, Balabhaskar Balasundaram, and Sergiy Butenko. Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. Computational Optimization and Applications, 56:113- 130, 2013.","title":"Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations","authors":"Svyatoslav Trukhanov, Chitra Balasubramaniam, Balabhaskar Balasundaram, Sergiy Butenko","year":"2013","venue":"Computational Optimization and Applications","doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Wang et al., 2020] Yiyuan Wang, Shaowei Cai, Jiejiang Chen, and Minghao Yin. Sccwalk: An efficient lo- cal search algorithm and its improvements for maxi- mum weight clique problem. Artificial Intelligence, 280:103230, 2020.","title":"Sccwalk: An efficient local search algorithm and its improvements for maximum weight clique problem","authors":"Wang","year":"2020","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Wang et al., 2023] Zhengren Wang, Yi Zhou, Chunyu Luo, and Mingyu Xiao. A fast maximum k-plex algorithm pa- rameterized by the degeneracy gap. In IJCAI, pages 5648- 5656, 2023.","title":"A fast maximum k-plex algorithm parameterized by the degeneracy gap","authors":"Wang","year":"2023","venue":"IJCAI","doi":null,"url":null,"internal_url":"/proceedings/2023/627"},{"position":33,"raw":"[Wasserman and Faust, 1994] Stanley Wasserman and Katherine Faust. Social network analysis: Methods and applications. 1994.","title":"Social network analysis: Methods and applications","authors":"Faust Wasserman, Stanley Wasserman, Katherine Faust","year":"1994","venue":null,"doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Wu and Hao, 2015] Qinghua Wu and Jin-Kao Hao. A re- view on algorithms for maximum clique problems. Euro- pean Journal of Operational Research, 242(3):693-709, 2015.","title":"A review on algorithms for maximum clique problems","authors":"Hao ; ] Qinghua Wu, Jin-Kao Wu, Hao","year":"2015","venue":"European Journal of Operational Research","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Wu et al., 2019] Kuixian Wu, Jian Gao, Rong Chen, and Xianji Cui. Vertex selection heuristics in branch-and- bound algorithms for the maximum k-plex problem. International Journal on Artificial Intelligence Tools, 28(05):1950015, 2019.","title":"Vertex selection heuristics in branch-andbound algorithms for the maximum k-plex problem","authors":"Kuixian Wu, Jian Gao, Rong Chen, Xianji Cui","year":"2019","venue":"International Journal on Artificial Intelligence Tools","doi":null,"url":null,"internal_url":null},{"position":36,"raw":"[Xiao et al., 2017] Mingyu Xiao, Weibo Lin, Yuanshun Dai, and Yifeng Zeng. A fast algorithm to compute maximum k-plexes in social network analysis. In AAAI, 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":"AAAI","doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Xu et al., 2007] Ke Xu, Frederic Boussemart, Fred Hemery, and Christophe Lecoutre. Random constraint satisfaction: easy generation of hard (satisfiable) instances. Artificial Intelligence, 171(8-9):514-534, 2007.","title":"Random constraint satisfaction: easy generation of hard (satisfiable) instances","authors":"Ke Xu, Frederic Boussemart, Fred Hemery, Christophe Lecoutre","year":"2007","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":38,"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},{"position":39,"raw":"[Zhou et al., 2021] Yi Zhou, Shan Hu, Mingyu Xiao, and Zhang-Hua Fu. Improving maximum k-plex solver via second-order reduction and graph color bounding. In AAAI, pages 12453-12460, 2021.","title":"Improving maximum k-plex solver via second-order reduction and graph color bounding","authors":"Yi Zhou, Shan Hu, Mingyu Xiao, Zhang-Hua Fu","year":"2021","venue":"AAAI","doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Zhu et al., 2020] Jinrong Zhu, Bilian Chen, and Yifeng Zeng. Community detection based on modularity and k- plexes. Information Sciences, 513:127-142, 2020.","title":"Community detection based on modularity and kplexes","authors":"Zhu","year":"2020","venue":"Information Sciences","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}