Hunting Multiple Bumps in Graphs
Summary: Multiple-bump graph hunting: given a weighted graph and query nodes, find k non-overlapping, connected subgraphs maximizing query–nonquery disparity while minimizing edge cost. PCSFP reduction; NP-hard even on trees; fast tree-approximation and improved graph results; adapts bump-hunting methods; experiments on real data show scalability and superior solutions. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
No non-self incoming citations found for this paper in this database.
Authors
- 1. Yahui Sun
- 2. Jun Luo
- 3. Theodoros Lappas
- 4. Xiaokui Xiao
- 5. Bin Cui
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,242 | Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties | 2022 | SIGMOD | 4.551877e-05 |
| 11,493 | Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights | 2021 | VLDB | 4.1945683e-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 |
|---|---|---|---|---|
| 1,013 | Robust Local Community Detection: On Free Rider Effect and Its Elimination | 2015 | VLDB | 0.00014645542 |
| 1,257 | Influential Community Search in Large Networks | 2015 | VLDB | 0.00013020648 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 6,588 | Efficient Progressive Minimum k-Core Search | 2020 | VLDB | 5.0020648e-05 |
| 6,207 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 5.1572428e-05 |
| 1,826 | Analysis of Two Existing and One New Dynamic Programming Algorithm for the Generation of Optimal Bushy Join Trees without Cross Products | 2006 | VLDB | 0.00010400425 |
| 5,366 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD | 5.5460085e-05 |
| 10,985 | Constant-time Connectivity Querying in Dynamic Graphs | 2024 | SIGMOD | 4.1945683e-05 |
| 5,683 | Efficient and Progressive Group Steiner Tree Search | 2016 | SIGMOD | 5.3723969e-05 |
| 5,043 | The Complexity of Mining Maximal Frequent Subgraphs | 2013 | PODS | 5.7411631e-05 |
| 11,264 | Approximating Probabilistic Group Steiner Trees in Graphs | 2023 | VLDB | 4.1945683e-05 |
| 11,493 | Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights | 2021 | VLDB | 4.1945683e-05 |
| 8,242 | Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties | 2022 | SIGMOD | 4.551877e-05 |