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)
Incoming Non-self Citations Over Time
Authors
- 1. Yang Liu (Harbin Engineering University)
- 2. Hejiao Huang (Harbin Engineering University)
- 3. Kaiqiang Yu (Nanyang Technological University)
- 4. Shengxin Liu (Harbin Engineering University)
- 5. Cheng Long (Nanyang Technological University)
BibTeX Citation
@inproceedings{liu_sigmod25,
title = {{Efficient Maximum s-Bundle Search via Local Vertex Connectivity}},
author = {Liu, Yang and Huang, Hejiao and Yu, Kaiqiang and Liu, Shengxin and Long, Cheng},
series = {{SIGMOD} '25},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3709687},
url = {https://dl.acm.org/doi/10.1145/3709687},
year = {2025}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,884 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD | 5.2559789e-05 |
| 10,565 | Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements | 2026 | SIGMOD | 4.9793485e-05 |
Previous
Page 1 / 1
Next
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.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 3,860 | Efficient Maximum k-Defective Clique Computation with Improved Time Complexity | 2023 | SIGMOD |
| 2 | 5,662 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 3 | 11,518 | Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee | 2024 | SIGMOD |
| 4 | 4,526 | Maximal Defective Clique Enumeration | 2023 | SIGMOD |
| 5 | 4,612 | Maximum k-Biplex Search on Bipartite Graphs: A Symmetric-BK Branching Approach | 2023 | SIGMOD |
| 6 | 8,884 | Efficient Defective Clique Enumeration and Search with Worst-Case Optimal Search Space | 2026 | SIGMOD |
| 7 | 3,444 | Efficient Size-Bounded Community Search over Large Networks | 2021 | VLDB |
| 8 | 5,552 | Theoretically and Practically Efficient Maximum Defective Clique Search | 2024 | SIGMOD |
| 9 | 10,565 | Efficient Size-Bounded Community Search, Revisited: Frameworks for Practical Improvements | 2026 | SIGMOD |
| 10 | 3,610 | Efficient k-Clique Listing: An Edge-Oriented Branching Strategy | 2024 | SIGMOD |