Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties
Summary: Temporal bumps: a connected subgraph and a time window that maximize PoI discrepancy in graphs with dynamic vertex properties. Proposes two approximations with trade-offs and two fast heuristics; experiments on real data show higher discrepancies and scalable performance versus baselines. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 9,277 | Temporal SIR-GN: Efficient and Effective Structural Representation Learning for Temporal Graphs | 2023 | VLDB | 4.3610659e-05 |
| 9,486 | Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries | 2024 | VLDB | 4.3300131e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 8 of 8 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,256 | Influential Community Search in Large Networks | 2015 | VLDB | 0.00013009097 |
| 1,893 | Querying Shortest Paths on Time Dependent Road Networks | 2019 | VLDB | 0.00010175836 |
| 3,369 | Online Density Bursting Subgraph Detection from Temporal Graphs | 2019 | VLDB | 7.1656755e-05 |
| 3,950 | COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks | 2015 | SIGMOD | 6.5925643e-05 |
| 4,976 | Constrained Shortest Path Query in a Large Time-Dependent Graph | 2019 | VLDB | 5.7854051e-05 |
| 5,376 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD | 5.5407342e-05 |
| 5,656 | An Optimal and Progressive Approach to Online Search of Top-K Influential Communities | 2018 | VLDB | 5.3876479e-05 |
| 11,635 | Hunting Multiple Bumps in Graphs | 2020 | VLDB | 4.1905499e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,920 | Time-Topology Analysis | 2021 | VLDB | 4.4229886e-05 |
| 9,231 | Efficiently Counting Triangles in Large Temporal Graphs | 2025 | SIGMOD | 4.3648789e-05 |
| 8,673 | On Reporting Durable Patterns in Temporal Proximity Graphs | 2024 | PODS | 4.4660157e-05 |
| 1,021 | Path Problems in Temporal Graphs | 2014 | VLDB | 0.00014608331 |
| 3,369 | Online Density Bursting Subgraph Detection from Temporal Graphs | 2019 | VLDB | 7.1656755e-05 |
| 4,726 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD | 5.9632682e-05 |
| 7,339 | Scalable Time-Range k-Core Query on Temporal Graphs | 2023 | VLDB | 4.7530782e-05 |
| 6,660 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 4.9672425e-05 |
| 4,209 | Mining Bursting Core in Large Temporal Graphs | 2022 | VLDB | 6.3511029e-05 |
| 11,635 | Hunting Multiple Bumps in Graphs | 2020 | VLDB | 4.1905499e-05 |