Back to papers
Efficient Maximum s-Bundle Search via Local Vertex Connectivity
Summary: SymBD, a branch-and-bound solver for the maximum s-bundle problem (cohesive subgraph resilient to vertex deletions) using local-vertex-connectivity based orderings. Achieves O*(λ_s^n) with λ_s<2; includes heuristic initial solution, divide-and-conquer, and parallelization, with up to five orders of magnitude speedup on 664 graphs.
(summarized by gpt-5-nano on Feb 09 2026)
- Paper ID
- 7034
- Venue
- SIGMOD
- Year
- 2025
- Pagerank
- 4.3441378e-05
- Overall Rank
- 9,390 | 34.68%
- DOI
-
10.1145/3709687
Incoming Non-self Citations Over Time
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
Outgoing Citations (Sorted by Pagerank)
Showing 19 of 19 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 |
| 283 |
Querying K-Truss Community in Large and Dynamic Graphs |
2014 |
SIGMOD |
0.00029041257 |
| 1,029 |
Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification |
2012 |
VLDB |
0.00014582849 |
| 2,225 |
Efficient Exact Algorithms for Maximum Balanced Biclique Search in Bipartite Graphs |
2021 |
SIGMOD |
9.2479064e-05 |
| 2,521 |
Efficient Algorithms for Maximal k-Biplex Enumeration |
2022 |
SIGMOD |
8.6065919e-05 |
| 3,854 |
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity |
2015 |
SIGMOD |
6.6988744e-05 |
| 4,081 |
Efficient Maximum k-Plex Computation over Large Sparse Graphs |
2023 |
VLDB |
6.4642761e-05 |
| 4,270 |
Efficient k-Clique Listing: An Edge-Oriented Branching Strategy |
2024 |
SIGMOD |
6.3067205e-05 |
| 4,743 |
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions |
2021 |
SIGMOD |
5.9586508e-05 |
| 4,984 |
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity |
2023 |
SIGMOD |
5.7867286e-05 |
| 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 |
| 5,696 |
Maximum k-Plex Computation: Theory and Practice |
2024 |
SIGMOD |
5.3673968e-05 |
| 5,908 |
Fast Maximal Clique Enumeration on Uncertain Graphs: A Pivot-based Approach |
2022 |
SIGMOD |
5.2773278e-05 |
| 6,207 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
5.1572428e-05 |
| 6,532 |
Hereditary Cohesive Subgraphs Enumeration on Bipartite Graphs: The Power of Pivot-based Approaches |
2023 |
SIGMOD |
5.0245678e-05 |
| 6,813 |
Theoretically and Practically Efficient Maximum Defective Clique Search |
2024 |
SIGMOD |
4.9187137e-05 |
| 7,111 |
Fast Maximal Quasi-clique Enumeration: A Pruning and Branching Co-Design Approach |
2023 |
SIGMOD |
4.8284522e-05 |
| 7,346 |
I/O Efficient ECC Graph Decomposition via Graph Reduction |
2016 |
VLDB |
4.7556749e-05 |
Semantically Similar Papers
| Overall Rank |
Paper |
Year |
Venue |
Pagerank |
| 4,984 |
Efficient Maximum k-Defective Clique Computation with Improved Time Complexity |
2023 |
SIGMOD |
5.7867286e-05 |
| 6,207 |
Efficiently Computing k-Edge Connected Components via Graph Decomposition |
2013 |
SIGMOD |
5.1572428e-05 |
| 10,959 |
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee |
2024 |
SIGMOD |
4.1945683e-05 |
| 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 |
| 10,074 |
Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space |
2026 |
SIGMOD |
4.1945683e-05 |
| 3,969 |
Efficient Size-Bounded Community Search over Large Networks |
2021 |
VLDB |
6.5787567e-05 |
| 10,076 |
Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements |
2026 |
SIGMOD |
4.1945683e-05 |
| 6,813 |
Theoretically and Practically Efficient Maximum Defective Clique Search |
2024 |
SIGMOD |
4.9187137e-05 |
| 4,270 |
Efficient k-Clique Listing: An Edge-Oriented Branching Strategy |
2024 |
SIGMOD |
6.3067205e-05 |