Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
research-article
Open access

Maximum k-Plex Computation: Theory and Practice

Published: 26 March 2024 Publication History

Abstract

The k-plex model relaxes the clique model by allowing each vertex to miss up to k neighbors, including the vertex itself. A 1-plex is a clique. Many exact algorithms have been recently designed for finding the k-plex with the largest number of vertices, known as the maximum k-plex computation problem. However, all the existing algorithms, except BS, has the trivial worst-case time complexity of O*(2n) when ignoring polynomial factors. On the other hand, although BS improves the time complexity to O*(βkn) where βk < 2 is a constant depending only on k, its practical performance is not satisfactory. In this paper, we study the maximum k-plex computation problem from both theory and practice. We first propose two new reduction rules and a new branching rule and prove that the base of the exponential time complexity is reduced to γk when the new reduction and branching rules are incorporated into a standard backtracking algorithm; here γk < βk. We then design a two-stage approach kPlexT to improve the exponent of the time complexity by separating the search of large k-plexes from the search of small ones. We prove that kPlexT runs in O*((α Δ)k+1 γ_kα) time when the maximum k-plex size Ωk(G) is at least 2k-1, and in O*((α Δ)k+1 γ_kα + min(γkn, n2k-2)) time otherwise; here, α is the degeneracy and Δ is the maximum degree of the input graph. We also prove that with slight modification, kPlexT runs in O*((αΔ)k+1 (k+1)α+k-Ωk(G)) time when ømega_k(G) ≥ 2k-1. Finally, we propose another reduction rule and a better initialization method to improve the practical performance of kPlexT. Extensive empirical studies demonstrate that kPlexT achieves state-of-the-art practical performance. We also show that our improved time complexity carries over to other related problems such as enumerating all maximal k-plexes, quasi-cliques, and k-biplexes.

References

[1]
Mohiuddin Ahmed, Abdun Naser Mahmood, and Md Rafiqul Islam. 2016. A survey of anomaly detection techniques in financial domain. Future Generation Computer Systems, Vol. 55 (2016), 278--288.
[2]
Albert Angel, Nick Koudas, Nikos Sarkas, Divesh Srivastava, Michael Svendsen, and Srikanta Tirthapura. 2014. Dense subgraph maintenance under streaming edge weight updates for real-time story identification. VLDB J., Vol. 23, 2 (2014), 175--199.
[3]
Balabhaskar Balasundaram, Sergiy Butenko, and Illya V. Hicks. 2011. Clique Relaxations in Social Network Analysis: The Maximum k-Plex Problem. Operations Research, Vol. 59, 1 (2011), 133--142.
[4]
Vladimir Batagelj and Matjaz Zaversnik. 2003. An O(m) Algorithm for Cores Decomposition of Networks. CoRR, Vol. cs.DS/0310049 (2003).
[5]
Punam Bedi and Chhavi Sharma. 2016. Community detection in social networks. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery, Vol. 6, 3 (2016), 115--135.
[6]
Balaram Behera, Edin Husic, Shweta Jain, Tim Roughgarden, and C. Seshadhri. 2022. FPT Algorithms for Finding Near-Cliques in c-Closed Graphs. In Proc. of ITCS'22 (LIPIcs, Vol. 215). 17:1--17:24.
[7]
Devora Berlowitz, Sara Cohen, and Benny Kimelfeld. 2015. Efficient Enumeration of Maximal k-Plexes. In Proc. of SIGMOD'15. 431--444.
[8]
Coenraad Bron and Joep Kerbosch. 1973. Finding All Cliques of an Undirected Graph (Algorithm 457). Commun. ACM, Vol. 16, 9 (1973), 575--576.
[9]
Lijun Chang. 2019. Efficient Maximum Clique Computation over Large Sparse Graphs. In Proc. of KDD'19. 529--538.
[10]
Lijun Chang, Mouyi Xu, and Darren Strash. 2022. Efficient Maximum k-Plex Computation over Large Sparse Graphs. PVLDB, Vol. 16, 2 (2022), 127--139.
[11]
Alessio Conte, Donatella Firmani, Caterina Mordente, Maurizio Patrignani, and Riccardo Torlone. 2017. Fast Enumeration of Large k-Plexes. In Proc. of KDD'17.
[12]
Alessio Conte, Tiziano De Matteis, Daniele De Sensi, Roberto Grossi, Andrea Marino, and Luca Versari. 2018. D2K: Scalable Community Detection in Massive Networks via Small-Diameter k-Plexes. In Proc. of KDD'18. 1272--1281.
[13]
Qiangqiang Dai, Rong-Hua Li, Hongchao Qin, Meihao Liao, and Guoren Wang. 2022. Scaling Up Maximal k-plex Enumeration. In Proc. of CIKM'22. 345--354.
[14]
Qiangqiang Dai, Rong-Hua Li, Xiaowei Ye, Meihao Liao, Weipeng Zhang, and Guoren Wang. 2023. Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches. Proc. ACM Manag. Data, Vol. 1, 2 (2023), 138:1--138:26.
[15]
David Eppstein, Maarten Lö ffler, and Darren Strash. 2013. Listing All Maximal Cliques in Large Sparse Real-World Graphs. ACM Journal of Experimental Algorithmics, Vol. 18 (2013).
[16]
Fedor V. Fomin and Dieter Kratsch. 2010. Exact Exponential Algorithms. Springer.
[17]
Jian Gao, Jiejiang Chen, Minghao Yin, Rong Chen, and Yiyuan Wang. 2018. An Exact Algorithm for Maximum k-Plexes in Massive Graphs. In Proc. IJCAI'19.
[18]
Guimu Guo, Da Yan, M. Tamer Ö zsu, Zhe Jiang, and Jalal Khalil. 2020. Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach. Proc. VLDB Endow., Vol. 14, 4 (2020), 573--585.
[19]
Hua Jiang, Dongming Zhu, Zhichao Xie, Shaowen Yao, and Zhang-Hua Fu. 2021. A New Upper Bound Based on Vertex Partitioning for the Maximum K-plex Problem. In Proc. of IJCAI'21. 1689--1696.
[20]
Tomohiro Koana, Christian Komusiewicz, and Frank Sommer. 2020. Computing Dense and Sparse Subgraphs of Weakly Closed Graphs. In Proc. of ISAAC'20 (LIPIcs, Vol. 181). 20:1--20:17.
[21]
John M. Lewis and Mihalis Yannakakis. 1980. The Node-Deletion Problem for Hereditary Properties is NP-Complete. J. Comput. Syst. Sci., Vol. 20, 2 (1980), 219--230.
[22]
Chu-Min Li, Hua Jiang, and Felip Manyà. 2017. On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem. Computers & OR, Vol. 84 (2017), 1--15.
[23]
Can Lu, Jeffrey Xu Yu, Hao Wei, and Yikai Zhang. 2017. Finding the Maximum Clique in Massive Graphs. PVLDB, Vol. 10, 11 (2017), 1538 -- 1549.
[24]
Benjamin McClosky and Illya V. Hicks. 2012. Combinatorial algorithms for the maximum k-plex problem. J. Comb. Optim., Vol. 23, 1 (2012), 29--49.
[25]
Mehryar Mohri, Afshin Rostamizadeh, and Ameet Talwalkar. 2012. Foundations of Machine Learning. MIT Press.
[26]
Hannes Moser, Rolf Niedermeier, and Manuel Sorge. 2012. Exact combinatorial algorithms and experiments for finding maximum k-plexes. J. Comb. Optim., Vol. 24, 3 (2012), 347--373.
[27]
Jian Pei, Daxin Jiang, and Aidong Zhang. 2005. On mining cross-graph quasi-cliques. In Proc. of KDD'05. 228--238.
[28]
Pablo San Segundo, Alvaro Lopez, and Panos M. Pardalos. 2016. A new exact maximum clique algorithm for large and massive sparse graphs. Computers & Operations Research, Vol. 66 (2016), 81--94.
[29]
S. Seidman and B. L. Foster. 1978. A graph?theoretic generalization of the clique concept. Journal of Mathematical Sociology, Vol. 6 (1978), 139--154.
[30]
Apichat Suratanee, Martin H Schaefer, Matthew J Betts, Zita Soons, Heiko Mannsperger, Nathalie Harder, Marcus Oswald, Markus Gipp, Ellen Ramminger, Guillermo Marcus, et al. 2014. Characterizing protein interactions employing a genome-wide siRNA cellular phenotyping screen. PLoS computational biology, Vol. 10, 9 (2014), e1003814.
[31]
Etsuji Tomita. 2017. Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications. In Proc. of WALCOM'17. 3--15.
[32]
Charalampos Tsourakakis, Francesco Bonchi, Aristides Gionis, Francesco Gullo, and Maria Tsiarli. 2013. Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In Proc. of KDD'13. 104--112.
[33]
Jia Wang and James Cheng. 2012. Truss Decomposition in Massive Networks. PVLDB, Vol. 5, 9 (2012).
[34]
Zhuo Wang, Qun Chen, Boyi Hou, Bo Suo, Zhanhuai Li, Wei Pan, and Zachary G. Ives. 2017. Parallelizing maximal clique and k-plex enumeration over graph data. J. Parallel Distributed Comput., Vol. 106 (2017), 79--91.
[35]
Zhengren Wang, Yi Zhou, Chunyu Luo, and Mingyu Xiao. 2023. A Fast Maximum k-Plex Algorithm Parameterized by the Degeneracy Gap. In Proc. of IJCAI'23. 5648--5656.
[36]
Zhengren Wang, Yi Zhou, Mingyu Xiao, and Bakhadyr Khoussainov. 2022. Listing Maximal k-Plexes in Large Real-World Graphs. In Proc. of WWW'22. 1517--1527.
[37]
Bin Wu and Xin Pei. 2007. A Parallel Algorithm for Enumerating All the Maximal k -Plexes. In PAKDD Workshops'07. 476--483.
[38]
Mingyu Xiao, Weibo Lin, Yuanshun Dai, and Yifeng Zeng. 2017. A Fast Algorithm to Compute Maximum k-Plexes in Social Network Analysis. In Proc. of AAAI'17.
[39]
Kaiqiang Yu and Cheng Long. 2023. Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach. Proc. ACM Manag. Data, Vol. 1, 1 (2023), 49:1--49:26.
[40]
Kaiqiang Yu and Cheng Long. 2024. Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach. Proc. ACM Manag. Data, Vol. 2 (2024).
[41]
Yi Zhou, Shan Hu, Mingyu Xiao, and Zhang-Hua Fu. 2021. Improving Maximum k-plex Solver via Second-Order Reduction and Graph Color Bounding. In Proc. of AAAI'21. 12453--12460.
[42]
Yi Zhou, Jingwei Xu, Zhenyu Guo, Mingyu Xiao, and Yan Jin. 2020. Enumerating Maximal k-Plexes with Worst-Case Time Guarantee. In Proc. of AAAI'20. 2442--2449.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Proceedings of the ACM on Management of Data
Proceedings of the ACM on Management of Data  Volume 2, Issue 1
SIGMOD
February 2024
1874 pages
EISSN:2836-6573
DOI:10.1145/3654807
Issue’s Table of Contents
This work is licensed under a Creative Commons Attribution-NoDerivatives International 4.0 License.

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 26 March 2024
Published in PACMMOD Volume 2, Issue 1

Author Tags

  1. exact exponential time algorithm
  2. k-plex

Qualifiers

  • Research-article

Funding Sources

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 626
    Total Downloads
  • Downloads (Last 12 months)626
  • Downloads (Last 6 weeks)103
Reflects downloads up to 05 Jan 2025

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Full Access

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media