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
- 2. Kaiqiang Yu
- 3. Cheng Long
Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,390 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 4.3441378e-05 |
| 9,406 | Efficient k-Clique Count Estimation with Accuracy Guarantee | 2024 | VLDB | 4.3441378e-05 |
| 10,037 | The Power of Core Clique Removal for Exact Clique Enumeration | 2026 | SIGMOD | 4.1945683e-05 |
| 10,074 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 4.1945683e-05 |
| 10,078 | Estimating Biclique Counts with Accuracy Guarantees | 2026 | SIGMOD | 4.1945683e-05 |
| 10,134 | A Unified Framework for Dense Subgraph Maintenance over Dynamic Bipartite Graphs | 2026 | SIGMOD | 4.1945683e-05 |
| 10,485 | Finding Logic Bugs in Graph-processing Systems via Graph-cutting | 2025 | SIGMOD | 4.1945683e-05 |
| 10,681 | Efficient k-Clique Densest Subgraph Discovery: Towards Bridging Practice and Theory | 2025 | VLDB | 4.1945683e-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 |
|---|---|---|---|---|
| 108 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00048300163 |
| 847 | Finding the Maximum Clique in Massive Graphs | 2017 | VLDB | 0.00015993322 |
| 1,029 | Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification | 2012 | VLDB | 0.00014582849 |
| 2,909 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB | 7.9305767e-05 |
| 3,975 | Accelerating Truss Decomposition on Heterogeneous Processors | 2020 | VLDB | 6.5736847e-05 |
| 5,751 | Effective and Efficient Dynamic Graph Coloring | 2018 | VLDB | 5.3409543e-05 |
Previous
Page 1 / 1
Next