Efficient k-Clique Listing: An Edge-Oriented Branching Strategy
Summary: Proposes edge-oriented branching (EBBkC) for k-clique listing, formulating sub-branches by expanding edges instead of vertices. Yields O(m*delta + k*m*(tau/2)^(k-2)) time (tau<delta), outperforming VBBkC (O(k*m*(delta/2)^(k-2))) for k>3; with dense-graph early-termination techniques, it excels in 19 real graphs. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Kaixin Wang (Nanyang Technological University)
- 2. Kaiqiang Yu (Nanyang Technological University)
- 3. Cheng Long (Nanyang Technological University)
BibTeX Citation
@inproceedings{wang_sigmod24,
title = {{Efficient k-Clique Listing: An Edge-Oriented Branching Strategy}},
author = {Wang, Kaixin and Yu, Kaiqiang and Long, Cheng},
series = {{SIGMOD} '24},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3639262},
url = {https://dl.acm.org/doi/10.1145/3639262},
year = {2024}
}Incoming Citations (Sorted by Pagerank)
Showing 9 of 9 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,540 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 5.2528121e-05 |
| 9,558 | Efficient k-Clique Count Estimation with Accuracy Guarantee | 2024 | VLDB | 5.2528121e-05 |
| 9,866 | Finding Logic Bugs in Graph-processing Systems via Graph-cutting | 2025 | SIGMOD | 5.2043672e-05 |
| 10,268 | Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy | 2026 | SIGMOD | 5.093636e-05 |
| 10,332 | The Power of Core Clique Removal for Exact Clique Enumeration | 2026 | SIGMOD | 5.093636e-05 |
| 10,365 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 5.093636e-05 |
| 10,369 | Estimating Biclique Counts with Accuracy Guarantees | 2026 | SIGMOD | 5.093636e-05 |
| 10,423 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,930 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 6 of 6 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 |
| 1,018 | Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification | 2012 | VLDB | 0.0001263063 |
| 1,509 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB | 0.00010539891 |
| 2,024 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB | 9.2907829e-05 |
| 3,503 | Accelerating Truss Decomposition on Heterogeneous Processors | 2020 | VLDB | 7.3592701e-05 |
| 5,797 | Effective and Efficient Dynamic Graph Coloring | 2018 | VLDB | 6.0859157e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,471 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD |
| 2 | 5,133 | Maximal Defective Clique Enumeration | 2023 | SIGMOD |
| 3 | 1,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD |
| 4 | 9,540 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD |
| 5 | 5,540 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 6 | 3,831 | Efficient Maximum k-Plex Computation over Large Sparse Graphs | 2023 | VLDB |
| 7 | 11,173 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD |
| 8 | 6,268 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD |
| 9 | 10,365 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD |
| 10 | 4,672 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |