Finding the Maximum Clique in Massive Graphs

Summary: RMC finds exact maximum cliques in massive graphs via randomized, probability-guaranteed seed-set reduction and binary search over clique size bounds. It replaces per-vertex enumeration with iterative k-clique searches, delivering substantially greater efficiency and robustness. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID: 11625
Venue: VLDB
Year: 2017
Pagerank: 0.00010539891
Overall Rank: 1,509 | 89.65%
DOI: 10.14778/3137628.3137635

Incoming Non-self Citations Over Time

Authors

1. Can Lu (Chinese University of Hong Kong)
2. Jeffrey Xu Yu (Chinese University of Hong Kong)
3. Hao Wei (Chinese University of Hong Kong)
4. Yikai Zhang (Chinese University of Hong Kong)

BibTeX Citation

@article{lu_vldb17,
        title = {{Finding the Maximum Clique in Massive Graphs}},
        author = {Lu, Can and Yu, Jeffrey Xu and Wei, Hao and Zhang, Yikai},
        journal = {PVLDB},
        series = {{VLDB} '17},
        volume = {10},
        number = {11},
        pages = {1538--1549},
        doi = {10.14778/3137628.3137635},
        url = {https://doi.org/10.14778/3137628.3137635},
        year = {2017}
}

Incoming Citations (Sorted by Pagerank)

Showing 11 of 11 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
780	Maximum Biclique Search at Billion Scale	2020	VLDB	0.00014091815
2,288	Pangolin: An Efficient and Flexible Graph Mining System on CPU and GPU	2020	VLDB	8.8025299e-05
3,831	Efficient Maximum k-Plex Computation over Large Sparse Graphs	2023	VLDB	7.0862742e-05
3,993	Efficient k-Clique Listing: An Edge-Oriented Branching Strategy	2024	SIGMOD	6.9688824e-05
5,197	Scalable Mining of Maximal Quasi-Cliques: An Algorithm-System Codesign Approach	2021	VLDB	6.3229492e-05
5,415	Making Graphs Compact by Lossless Contraction	2021	SIGMOD	6.2255551e-05
5,471	Maximum k-Plex Computation: Theory and Practice	2024	SIGMOD	6.2061433e-05
7,233	One Set to Cover All Maximal Cliques Approximately	2022	SIGMOD	5.6658655e-05
10,365	Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space	2026	SIGMOD	5.093636e-05
10,802	Most Similar Biclique Search at Scale	2025	VLDB	5.093636e-05
11,666	Graph Iso/Auto-morphism: A Divide-&-Conquer Approach	2021	SIGMOD	5.093636e-05

Outgoing Citations (Sorted by Pagerank)

Showing 3 of 3 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank	Cited Paper	Year	Venue	Pagerank
102	Truss Decomposition in Massive Networks	2012	VLDB	0.00034255289
138	Discovering Large Dense Subgraphs in Massive Graphs	2005	VLDB	0.00029823423
674	Finding Maximal Cliques in Massive Networks by H*-graph	2010	SIGMOD	0.00015081844

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	7,233	One Set to Cover All Maximal Cliques Approximately	2022	SIGMOD
2	780	Maximum Biclique Search at Billion Scale	2020	VLDB
3	5,133	Maximal Defective Clique Enumeration	2023	SIGMOD
4	1,307	KClist++: A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs	2020	VLDB
5	4,672	Efficient Maximum k-Defective Clique Computation with Improved Time Complexity	2023	SIGMOD
6	1,633	Efficient Enumeration of Maximal k-Plexes	2015	SIGMOD
7	6,268	Theoretically and Practically Efficient Maximum Defective Clique Search	2024	SIGMOD
8	7,444	Accelerating Maximal Clique Enumeration via Graph Reduction	2024	VLDB
9	10,365	Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space	2026	SIGMOD
10	674	Finding Maximal Cliques in Massive Networks by H*-graph	2010	SIGMOD