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,236 | Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties | 2022 | SIGMOD | 4.5475127e-05 |
| 11,497 | Finding Group Steiner Trees in Graphs with both Vertex and Edge Weights | 2021 | VLDB | 4.1905499e-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,014 | Robust Local Community Detection: On Free Rider Effect and Its Elimination | 2015 | VLDB | 0.00014631717 |
| 1,256 | Influential Community Search in Large Networks | 2015 | VLDB | 0.00013009097 |
Previous
Page 1 / 1
Next