Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches
Summary: Pivot-based enumeration framework for maximal hereditary subgraphs in bipartite graphs, unifying maximal bicliques and maximal k-biplexes. Near-optimal: O(m × 2^{n/2}) (O(m × 1.414^n)); polynomial-delay variant; experiments on 11 real graphs show speedups. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Qiangqiang Dai (Beijing Institute of Technology)
- 2. Rong-Hua Li (Beijing Institute of Technology)
- 3. Xiaowei Ye (Beijing Institute of Technology)
- 4. Meihao Liao (Beijing Institute of Technology)
- 5. Weipeng Zhang (Tencent)
- 6. Guoren Wang (Beijing Institute of Technology)
BibTeX Citation
@inproceedings{dai_sigmod23,
title = {{Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches}},
author = {Dai, Qiangqiang and Li, Rong-Hua and Ye, Xiaowei and Liao, Meihao and Zhang, Weipeng and Wang, Guoren},
series = {{SIGMOD} '23},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3589283},
url = {https://dl.acm.org/doi/10.1145/3589283},
year = {2023}
}
Incoming Citations (Sorted by Pagerank)
Showing 7 of 7 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,471 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD | 6.2061433e-05 |
| 9,049 | BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs | 2025 | SIGMOD | 5.3251649e-05 |
| 9,540 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 5.2528121e-05 |
| 9,551 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 5.2528121e-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,407 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD | 5.093636e-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 |
|---|---|---|---|---|
| 1,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00010164289 |
| 2,453 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD | 8.5574945e-05 |
| 2,860 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 8.0215536e-05 |
| 5,141 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD | 6.3485708e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,141 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD |
| 2 | 2,294 | (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 3 | 10,268 | Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy | 2026 | SIGMOD |
| 4 | 4,143 | Efficient Biclique Counting in Large Bipartite Graphs | 2023 | SIGMOD |
| 5 | 5,133 | Maximal Defective Clique Enumeration | 2023 | SIGMOD |
| 6 | 2,453 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD |
| 7 | 2,860 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB |
| 8 | 5,556 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD |
| 9 | 10,407 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD |
| 10 | 11,173 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD |