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)
Incoming Non-self Citations Over Time
Authors
- 1. Xiaofan Li
- 2. Rui Zhou
- 3. Lu Chen
- 4. Chengfei Liu
- 5. Qiang He
- 6. Yun Yang
Incoming Citations (Sorted by Pagerank)
Showing 1 of 1 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,111 | Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach | 2023 | SIGMOD | 4.8284522e-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 |
|---|---|---|---|---|
| 686 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.00018178029 |
| 847 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB | 0.00015993322 |
| 5,170 | Pricing Influential Nodes in Online Social Networks | 2020 | VLDB | 5.6471109e-05 |
| 7,145 | Tight Trade-offs for the Maximum k-Coverage Problem in the General Streaming Model | 2019 | PODS | 4.8179617e-05 |
Previous
Page 1 / 1
Next