Lijun Chang
Abstract
k-defective cliques relax cliques by allowing up-to k missing edges from being a complete graph. This relaxation enables us to find larger near-cliques and has applications in link prediction, cluster detection, social network analysis and transportation science. The problem of finding the largest k-defective clique has been recently studied with several algorithms being proposed in the literature. However, the currently fastest algorithm KDBB does not improve its time complexity from being the trivial O(2n), and also, KDBB's practical performance is still not satisfactory. In this paper, we advance the state of the art for exact maximum k-defective clique computation, in terms of both time complexity and practical performance. Moreover, we separate the techniques required for achieving the time complexity from others purely used for practical performance consideration; this design choice may facilitate the research community to further improve the practical efficiency while not sacrificing the worst case time complexity. In specific, we first develop a general framework kDC that beats the trivial time complexity of O(2n) and achieves a better time complexity than all existing algorithms. The time complexity of kDC is solely achieved by our newly designed non-fully-adjacent-first branching rule, excess-removal reduction rule and high-degree reduction rule. Then, to make kDC practically efficient, we further propose a new upper bound, two new reduction rules, and an algorithm for efficiently computing a large initial solution. Extensive empirical studies on three benchmark graph collections with 290 graphs in total demonstrate that kDC outperforms the currently fastest algorithm KDBB by several orders of magnitude.
- James Abello, Mauricio G. C. Resende, and Sandra Sudarsky. 2002. Massive Quasi-Clique Detection. In Proc. of LATIN'02 (Lecture Notes in Computer Science, Vol. 2286). Springer, 598--612.Google Scholar
Cross Ref
- 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.Google ScholarDigital Library
- 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.Google ScholarCross Ref
- 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.Google ScholarDigital Library
- 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.Google ScholarDigital Library
- Jean-Marie Bourjolly, Gilbert Laporte, and Gilles Pesant. 2002. An exact algorithm for the maximum k-club problem in an undirected graph. Eur. J. Oper. Res., Vol. 138, 1 (2002), 21--28.Google ScholarCross Ref
- Randy Carraghan and Panos M. Pardalos. 1990. An Exact Algorithm for the Maximum Clique Problem. Oper. Res. Lett., Vol. 9, 6 (Nov. 1990), 375--382.Google ScholarDigital Library
- Lijun Chang. 2019. Efficient Maximum Clique Computation over Large Sparse Graphs. In Proc. of KDD'19. 529--538.Google ScholarDigital Library
- Lijun Chang. 2020. Efficient maximum clique computation and enumeration over large sparse graphs. VLDB J., Vol. 29, 5 (2020), 999--1022.Google ScholarCross Ref
- Lijun Chang and Lu Qin. 2018. Cohesive Subgraph Computation over Large Sparse Graphs. Springer Series in the Data Sciences.Google Scholar
- Xiaoyu Chen, Yi Zhou, Jin-Kao Hao, and Mingyu Xiao. 2021. Computing maximum k-defective cliques in massive graphs. Comput. Oper. Res., Vol. 127 (2021), 105131.Google ScholarCross Ref
- Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. 2001. Introduction to Algorithms. McGraw-Hill Higher Education.Google Scholar
- 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.Google ScholarDigital Library
- 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).Google Scholar
- Fedor V. Fomin and Dieter Kratsch. 2010. Exact Exponential Algorithms. Springer.Google ScholarDigital Library
- Jian Gao, Zhenghang Xu, Ruizhi Li, and Minghao Yin. 2022. An Exact Algorithm with New Upper Bounds for the Maximum k-Defective Clique Problem in Massive Sparse Graphs. In Proc. of AAAI'22. 10174--10183.Google ScholarCross Ref
- Timo Gschwind, Stefan Irnich, Fabio Furini, and Roberto Wolfler Calvo. 2021. A Branch-and-Price Framework for Decomposing Graphs into Relaxed Cliques. INFORMS J. Comput., Vol. 33, 3 (2021), 1070--1090.Google ScholarDigital Library
- Timo Gschwind, Stefan Irnich, and Isabel Podlinski. 2018. Maximum weight relaxed cliques and Russian Doll Search revisited. Discret. Appl. Math., Vol. 234 (2018), 131--138.Google ScholarCross Ref
- Johan Håstad. 1996. Clique is Hard to Approximate Within n(^1-epsilon ). In Proc. of FOCS'96. 627--636.Google Scholar
- Shweta Jain and C. Seshadhri. 2020a. The Power of Pivoting for Exact Clique Counting. In Proc. WSDM'20. ACM, 268--276.Google Scholar
- Shweta Jain and C. Seshadhri. 2020b. Provably and Efficiently Approximating Near-cliques using the Turá n Shadow: PEANUTS. In Proc. of WWW'20. ACM / IW3C2, 1966--1976.Google Scholar
- Tang Jian. 1986. An O(2(^0.304n )) Algorithm for Solving Maximum Independent Set Problem. IEEE Trans. Computers, Vol. 35, 9 (1986), 847--851.Google ScholarDigital Library
- Richard M. Karp. 1972. Reducibility Among Combinatorial Problems. In Proc. of CCC'72. 85--103.Google ScholarCross Ref
- Victor E. Lee, Ning Ruan, Ruoming Jin, and Charu C. Aggarwal. 2010. A Survey of Algorithms for Dense Subgraph Discovery. In Managing and Mining Graph Data. Advances in Database Systems, Vol. 40. Springer, 303--336.Google Scholar
- Chu-Min Li, Zhiwen Fang, and Ke Xu. 2013. Combining MaxSAT Reasoning and Incremental Upper Bound for the Maximum Clique Problem. In Proc. of ICTAI'13.Google ScholarDigital Library
- 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.Google ScholarDigital Library
- Ronghua Li, Sen Gao, Lu Qin, Guoren Wang, Weihua Yang, and Jeffrey Xu Yu. 2020. Ordering Heuristics for k-clique Listing. Proc. VLDB Endow., Vol. 13, 11 (2020), 2536--2548.Google ScholarDigital Library
- David W. Matula and Leland L. Beck. 1983. Smallest-Last Ordering and clustering and Graph Coloring Algorithms. J. ACM, Vol. 30, 3 (1983), 417--427.Google ScholarDigital Library
- Panos M. Pardalos and Jue Xue. 1994. The maximum clique problem. J. global Optimization, Vol. 4, 3 (1994), 301--328.Google Scholar
- Bharath Pattabiraman, Md. Mostofa Ali Patwary, Assefaw Hadish Gebremedhin, Wei-keng Liao, and Alok N. Choudhary. 2015. Fast Algorithms for the Maximum Clique Problem on Massive Graphs with Applications to Overlapping Community Detection. Internet Mathematics, Vol. 11, 4--5 (2015), 421--448.Google ScholarCross Ref
- Jeffrey Pattillo, Nataly Youssef, and Sergiy Butenko. 2013. On clique relaxation models in network analysis. Eur. J. Oper. Res., Vol. 226, 1 (2013), 9--18.Google ScholarCross Ref
- J. M. Robson. 1986. Algorithms for Maximum Independent Sets. J. Algorithms, Vol. 7, 3 (1986), 425--440.Google ScholarCross Ref
- J. M. Robson. 2001. Finding a maximum independent set in time $O(2^n/4)$. smallhttps://www.labri.fr/perso/robson/mis/techrep.html.Google Scholar
- Ryan A. Rossi, David F. Gleich, and Assefaw Hadish Gebremedhin. 2015. Parallel Maximum Clique Algorithms with Applications to Network Analysis. SIAM J. Scientific Computing, Vol. 37, 5 (2015).Google ScholarDigital Library
- H. Sachs. 1963. Regular Graphs with Given Girth and Restricted Circuits. Journal of the London Mathematical Society, Vol. s1--38, 1 (1963), 423--429.Google Scholar
- 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.Google ScholarDigital Library
- Stephen B. Seidman. 1983. Network structure and minimum degree. Social Networks, Vol. 5, 3 (1983), 269 -- 287.Google ScholarCross Ref
- Hanif D. Sherali, J. Cole Smith, and Antonio A. Trani. 2002. An Airspace Planning Model for Selecting Flight-plans Under Workload, Safety, and Equity Considerations. Transp. Sci., Vol. 36, 4 (2002), 378--397.Google ScholarDigital Library
- Vladimir Stozhkov, Austin Buchanan, Sergiy Butenko, and Vladimir Boginski. 2022. Continuous cubic formulations for cluster detection problems in networks. Math. Program., Vol. 196, 1 (2022), 279--307.Google ScholarDigital Library
- 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.Google Scholar
- Robert Endre Tarjan and Anthony E. Trojanowski. 1977. Finding a Maximum Independent Set. SIAM J. Comput., Vol. 6, 3 (1977), 537--546.Google ScholarDigital Library
- Etsuji Tomita. 2017. Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications. In Proc. of WALCOM'17. 3--15.Google ScholarCross Ref
- Etsuji Tomita, Yoichi Sutani, Takanori Higashi, Shinya Takahashi, and Mitsuo Wakatsuki. 2010. A simple and faster branch-and-bound algorithm for finding a maximum clique. In Proc. of WALCOM'10. 191--203.Google ScholarDigital Library
- Svyatoslav Trukhanov, Chitra Balasubramaniam, Balabhaskar Balasundaram, and Sergiy Butenko. 2013. Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. Comput. Optim. Appl., Vol. 56, 1 (2013), 113--130.Google ScholarDigital Library
- Gé rard Verfaillie, Michel Lema^i tre, and Thomas Schiex. 1996. Russian Doll Search for Solving Constraint Optimization Problems. In Proc. of AAAI'96. AAAI Press / The MIT Press, 181--187.Google Scholar
- Jia Wang and James Cheng. 2012. Truss Decomposition in Massive Networks. PVLDB, Vol. 5, 9 (2012).Google ScholarDigital Library
- Jingen Xiang, Cong Guo, and Ashraf Aboulnaga. 2013. Scalable maximum clique computation using mapreduce. In Proc. of ICDE'13. 74--85.Google Scholar
- Mihalis Yannakakis. 1978. Node- and Edge-Deletion NP-Complete Problems. In Proc. of STOC'78. ACM, 253--264.Google ScholarDigital Library
- Haiyuan Yu, Alberto Paccanaro, Valery Trifonov, and Mark Gerstein. 2006. Predicting interactions in protein networks by completing defective cliques. Bioinform., Vol. 22, 7 (2006), 823--829.Google ScholarDigital Library
- 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.Google ScholarCross Ref
Index Terms
- Efficient Maximum k-Defective Clique Computation with Improved Time Complexity
Recommendations
Maximum Clique Transversals
WG '01: Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer ScienceA maximum clique transversal set in a graph G is a set S of vertices such that every maximum clique of G contains at least a vertex in S . Clearly, removing a maximum clique transversal set reduces the clique number of a graph. We study ...
Split clique graph complexity
A complete set of a graph G is a subset of vertices inducing a complete subgraph. A clique is a maximal complete set. Denote by C(G) the clique family of G. The clique graph of G, denoted by K(G), is the intersection graph of C(G). Say that G is a ...
Split clique graph complexity
WG'11: Proceedings of the 37th international conference on Graph-Theoretic Concepts in Computer ScienceA complete set of a graph G is a subset of vertices inducing a complete subgraph. A clique is a maximal complete set. Denote by <InlineEquation ID="IEq1"><InlineMediaObject><ImageObject FileRef="978-3-642-25870-1_3_Chapter_TeX2GIF_IEq1.gif" Format="GIF" ...
Comments