Back to papers
Efficient Algorithms for Maximal k-Biplex Enumeration
Summary: iTraversal, a reverse-search on a solution graph, enumerates all maximal k-biplexes with polynomial delay. It uses an initial solution and pruning to yield a sparse graph (~0.1% of bTraversal) and up to 10^4x speedups on graphs with 1B edges.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 6299
- Venue
- SIGMOD
- Year
- 2022
- Pagerank
- 8.6065919e-05
- Overall Rank
- 2,521 | 82.47%
- DOI
-
10.1145/3514221.3517847
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 14 of 14 citing papers.
| Rank |
Citing Paper |
Year |
Venue |
Pagerank |
| 5,022 |
Maximal Defective Clique Enumeration |
2023 |
SIGMOD |
5.7536318e-05 |
| 5,124 |
Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach |
2023 |
SIGMOD |
5.6795646e-05 |
| 6,183 |
Efficient Core Maintenance in Large Bipartite Graphs |
2023 |
SIGMOD |
5.1667703e-05 |
| 6,532 |
Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches |
2023 |
SIGMOD |
5.0245678e-05 |
| 7,111 |
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach |
2023 |
SIGMOD |
4.8284522e-05 |
| 8,897 |
BCviz: A Linear-Space Index for Mining and Visualizing Cohesive Bipartite Subgraphs |
2025 |
SIGMOD |
4.427232e-05 |
| 9,244 |
Densest Multipartite Subgraph Search in Heterogeneous Information Networks |
2024 |
VLDB |
4.3690661e-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 |
| 9,484 |
Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries |
2024 |
VLDB |
4.3341665e-05 |
| 10,119 |
Theoretically and Practically Efficient Maximum Biclique Search |
2026 |
SIGMOD |
4.1945683e-05 |
| 10,373 |
Density Decomposition of Bipartite Graphs |
2025 |
SIGMOD |
4.1945683e-05 |
| 10,535 |
In-depth Analysis of Densest Subgraph Discovery in a Unified Framework |
2025 |
VLDB |
4.1945683e-05 |
| 10,959 |
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee |
2024 |
SIGMOD |
4.1945683e-05 |
Outgoing Citations (Sorted by Pagerank)
Showing 5 of 5 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 2,903 |
(p,q)-biclique Counting and Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.9375744e-05 |
| 5,022 |
Maximal Defective Clique Enumeration |
2023 |
SIGMOD |
5.7536318e-05 |
| 4,626 |
Efficient Biclique Counting in Large Bipartite Graphs |
2023 |
SIGMOD |
6.0399035e-05 |
| 2,225 |
Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs |
2021 |
SIGMOD |
9.2479064e-05 |
| 10,119 |
Theoretically and Practically Efficient Maximum Biclique Search |
2026 |
SIGMOD |
4.1945683e-05 |
| 1,650 |
Efficient Enumeration of Maximal k-Plexes |
2015 |
SIGMOD |
0.00011013428 |
| 5,124 |
Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach |
2023 |
SIGMOD |
5.6795646e-05 |
| 6,532 |
Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches |
2023 |
SIGMOD |
5.0245678e-05 |
| 3,492 |
Efficient Maximal Biclique Enumeration for Large Sparse Bipartite Graphs |
2022 |
VLDB |
7.044442e-05 |
| 10,959 |
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee |
2024 |
SIGMOD |
4.1945683e-05 |