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
BibTeX Citation
@inproceedings{sun_sigmod22,
title = {{Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties}},
author = {Sun, Yahui and Ma, Shuai and Cui, Bin},
series = {{SIGMOD} '22},
booktitle = {Proceedings of the {ACM} {SIGMOD} International Conference on Management of Data},
publisher = {Association for Computing Machinery},
doi = {10.1145/3514221.3517859},
url = {https://dl.acm.org/doi/10.1145/3514221.3517859},
year = {2022}
}
Incoming Citations (Sorted by Pagerank)
Showing 2 of 2 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,671 | Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries | 2024 | VLDB | 5.2917782e-05 |
| 9,528 | Temporal SIR-GN: Efficient and Effective Structural Representation Learning for Temporal Graphs | 2023 | VLDB | 5.1656406e-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,007 | Influential Community Search in Large Networks | 2015 | VLDB | 0.00012556573 |
| 1,722 | Querying Shortest Paths on Time Dependent Road Networks | 2019 | VLDB | 9.7932895e-05 |
| 2,946 | Online Density Bursting Subgraph Detection from Temporal Graphs | 2019 | VLDB | 7.8250028e-05 |
| 3,498 | COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks | 2015 | SIGMOD | 7.2551144e-05 |
| 4,340 | Constrained Shortest Path Query in a Large Time-Dependent Graph | 2019 | VLDB | 6.6518685e-05 |
| 5,150 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD | 6.2536113e-05 |
| 5,264 | An Optimal and Progressive Approach to Online Search of Top-K Influential Communities | 2018 | VLDB | 6.2038361e-05 |
| 12,127 | Hunting Multiple Bumps in Graphs | 2020 | VLDB | 4.9793485e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,832 | On Reporting Durable Patterns in Temporal Proximity Graphs | 2024 | PODS |
| 2 | 1,105 | Path Problems in Temporal Graphs | 2014 | VLDB |
| 3 | 10,495 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD |
| 4 | 2,946 | Online Density Bursting Subgraph Detection from Temporal Graphs | 2019 | VLDB |
| 5 | 10,854 | Worst-Case Optimal BGPs on Temporal Graphs | 2026 | VLDB |
| 6 | 6,767 | Scalable Time-Range k-Core Query on Temporal Graphs | 2023 | VLDB |
| 7 | 3,921 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD |
| 8 | 6,200 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |
| 9 | 3,376 | Mining Bursting Core in Large Temporal Graphs | 2022 | VLDB |
| 10 | 12,127 | Hunting Multiple Bumps in Graphs | 2020 | VLDB |