Hunting Multiple Bumps in Graphs
Summary: Extends graph bump hunting to k non-overlapping connected subgraphs in weighted graphs, jointly maximizing query-node enrichment and minimizing edge cost. Reduces the problem to PCSFP, proves tree-level NP-hardness, and develops scalable approximations that dominate prior methods. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yahui Sun (Nanyang Technological University)
- 2. Jun Luo (Nanyang Technological University)
- 3. Theodoros Lappas (Stevens Institute of Technology)
- 4. Xiaokui Xiao (National University of Singapore)
- 5. Bin Cui (Peking University)
BibTeX Citation
@article{sun_vldb20,
title = {{Hunting Multiple Bumps in Graphs}},
author = {Sun, Yahui and Luo, Jun and Lappas, Theodoros and Xiao, Xiaokui and Cui, Bin},
journal = {PVLDB},
series = {{VLDB} '20},
volume = {13},
number = {5},
pages = {656--669},
doi = {10.14778/3377369.3377375},
url = {https://doi.org/10.14778/3377369.3377375},
year = {2020}
}Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,538 | Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties | 2022 | SIGMOD | 5.3203262e-05 |
| 8,692 | Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights | 2021 | VLDB | 5.2905577e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 2 of 2 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 830 | Robust Local Community Detection: On Free Rider Effect and Its Elimination | 2015 | VLDB | 0.00013605481 |
| 1,007 | Influential Community Search in Large Networks | 2015 | VLDB | 0.00012556573 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 5,662 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD |
| 2 | 1,301 | Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products | 2006 | VLDB |
| 3 | 5,150 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD |
| 4 | 11,540 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD |
| 5 | 10,812 | A Practical Sublinear Approximation for Group Steiner Tree | 2026 | VLDB |
| 6 | 5,531 | Efficient and Progressive Group Steiner Tree Search | 2016 | SIGMOD |
| 7 | 7,668 | The Complexity of Mining Maximal Frequent Subgraphs | 2013 | PODS |
| 8 | 11,775 | Approximating Probabilistic Group Steiner Trees in Graphs | 2023 | VLDB |
| 9 | 8,692 | Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights | 2021 | VLDB |
| 10 | 8,538 | Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties | 2022 | SIGMOD |