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
- 2. Rong-Hua Li
- 3. Xiaowei Ye
- 4. Meihao Liao
- 5. Weipeng Zhang
- 6. Guoren Wang
Incoming Citations (Sorted by Pagerank)
Showing 6 of 6 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,696 | Maximum k-Plex Computation: Theory and Practice | 2024 | SIGMOD | 5.3673968e-05 |
| 8,897 | BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs | 2025 | SIGMOD | 4.427232e-05 |
| 9,390 | Efficient Maximum s-Bundle Search via Local Vertex Connectivity | 2025 | SIGMOD | 4.3441378e-05 |
| 9,398 | Maximum k-Plex Search: An Alternated Reduction-and-Bound Method | 2025 | VLDB | 4.3441378e-05 |
| 10,037 | The Power of Core Clique Removal for Exact Clique Enumeration | 2026 | SIGMOD | 4.1945683e-05 |
| 10,119 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD | 4.1945683e-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,650 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00011013428 |
| 2,521 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD | 8.6065919e-05 |
| 3,492 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 7.044442e-05 |
| 5,124 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD | 5.6795646e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,757 | Identifying Similar-Bicliques in Bipartite Graphs | 2022 | VLDB | 4.6598957e-05 |
| 5,124 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD | 5.6795646e-05 |
| 2,903 | (p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 7.9375744e-05 |
| 4,626 | Efficient Biclique Counting in Large Bipartite Graphs | 2023 | SIGMOD | 6.0399035e-05 |
| 5,022 | Maximal Defective Clique Enumeration | 2023 | SIGMOD | 5.7536318e-05 |
| 2,521 | Efficient Algorithms for Maximal k-Biplex Enumeration | 2022 | SIGMOD | 8.6065919e-05 |
| 3,492 | Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs | 2022 | VLDB | 7.044442e-05 |
| 5,908 | Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach | 2022 | SIGMOD | 5.2773278e-05 |
| 10,119 | Theoretically and Practically Efficient Maximum Biclique Search | 2026 | SIGMOD | 4.1945683e-05 |
| 10,959 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD | 4.1945683e-05 |