DBScholar

Back to papers

One Set to Cover All Maximal Cliques Approximately

Summary: Defines tau-cover: a vertex set hitting every maximal clique by at least tau. NP-hard and non-submodular; MCCb, MCC, EMCC; MCC uses incremental bounds, EMCC adaptive sampling; experiments show MCC faster with smaller covers, EMCC even smaller and faster. (summarized by gpt-5-nano on Feb 09 2026)

Paper ID
h622eded247b1728f
Venue
SIGMOD
Year
2022
Pagerank
5.5407607e-05
Overall Rank
7,368 | 50.47%
DOI
10.1145/3514221.3517881

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@inproceedings{li_sigmod22,
        title = {{One Set to Cover All Maximal Cliques Approximately}},
        author = {Li, Xiaofan and Zhou, Rui and Chen, Lu and Liu, Chengfei and He, Qiang and Yang, Yun},
        series = {{SIGMOD} '22},
        booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
        publisher = {Association for Computing Machinery},
        doi = {10.1145/3514221.3517881},
        url = {https://dl.acm.org/doi/10.1145/3514221.3517881},
        year = {2022}
}

Incoming Citations (Sorted by Pagerank)

Showing 1 of 1 citing papers.

Rank Citing Paper Year Venue Pagerank
7,043 Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach 2023 SIGMOD 5.6141221e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 4 of 4 cited papers.

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

Rank Cited Paper Year Venue Pagerank
645 Finding Maximal Cliques in Massive Networks by H*-graph 2010 SIGMOD 0.00015213733
1,507 Finding the Maximum Clique in Massive Graphs 2017 VLDB 0.00010450256
5,202 Pricing Influential Nodes in Online Social Networks 2020 VLDB 6.2317454e-05
7,849 Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model 2019 PODS 5.4410785e-05
Previous Page 1 / 1 Next

Semantically Similar Papers