Online Density Bursting Subgraph Detection from Temporal Graphs
Summary: Online DBS detection on streaming temporal graphs; long-duration DBSs decompose into indecomposable DBSs with equal or greater burstiness. Introduces TopkDBSOL, a bounded-memory online algorithm to detect top-k DBSs and demonstrates scalability on real data. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Lingyang Chu (Huawei)
- 2. Yanyan Zhang (Fortinet Technology (Canada))
- 3. Yu Yang (City University of Hong Kong)
- 4. Lanjun Wang (Huawei)
- 5. Jian Pei (Simon Fraser University)
BibTeX Citation
@article{chu_vldb19,
title = {{Online Density Bursting Subgraph Detection from Temporal Graphs}},
author = {Chu, Lingyang and Zhang, Yanyan and Yang, Yu and Wang, Lanjun and Pei, Jian},
journal = {PVLDB},
series = {{VLDB} '19},
volume = {12},
number = {13},
pages = {2353--2365},
doi = {10.14778/3358701.3358704},
url = {https://doi.org/10.14778/3358701.3358704},
year = {2019}
}Incoming Citations (Sorted by Pagerank)
Showing 13 of 13 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 4 of 4 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 96 | Truss Decomposition in Massive Networks | 2012 | VLDB | 0.00034261728 |
| 978 | Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification | 2012 | VLDB | 0.00012699423 |
| 4,323 | On Dense Pattern Mining in Graph Streams | 2010 | VLDB | 6.650678e-05 |
| 12,498 | ALID: Scalable Dominant Cluster Detection | 2015 | VLDB | 4.9605343e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 9,282 | Time-Topology Analysis | 2021 | VLDB |
| 2 | 10,291 | Integral Densest Subgraph Search on Directed Graphs | 2025 | SIGMOD |
| 3 | 8,563 | Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties | 2022 | SIGMOD |
| 4 | 10,879 | Efficient Locally h-Clique Densest Subgraph Discovery via Divide-and-Conquer | 2026 | VLDB |
| 5 | 9,004 | Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery | 2023 | SIGMOD |
| 6 | 1,995 | Efficient Algorithms for Densest Subgraph Discovery | 2019 | VLDB |
| 7 | 3,778 | Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2020 | SIGMOD |
| 8 | 6,505 | Scalable Time-Range k-Core Query on Temporal Graphs | 2023 | VLDB |
| 9 | 9,957 | Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs | 2024 | VLDB |
| 10 | 3,387 | Mining Bursting Core in Large Temporal Graphs | 2022 | VLDB |