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)

Paper ID: 12144
Venue: VLDB
Year: 2019
Pagerank: 7.9828452e-05
Overall Rank: 2,896 | 80.14%
DOI: 10.14778/3358701.3358704

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 12 of 12 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
3,337	Mining Bursting Core in Large Temporal Graphs	2022	VLDB	7.5072753e-05
6,156	QTCS: Efficient Query-Centered Temporal Community Search	2024	VLDB	5.9560993e-05
6,635	Scalable Time-Range k-Core Query on Temporal Graphs	2023	VLDB	5.8174952e-05
8,365	Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties	2022	SIGMOD	5.44244e-05
8,718	Evolution Forest Index: Towards Optimal Temporal k-Core Component Search via Time-Topology Isomorphic Computation	2024	VLDB	5.3774243e-05
8,812	On More Efficiently and Versatilely Querying Historical k-Cores	2025	VLDB	5.3652966e-05
9,189	RUSH: Real-time Burst Subgraph Detection in Dynamic Graphs	2024	VLDB	5.3058708e-05
10,424	ABFlow: Alert Bursting Flow Query in Streaming Temporal Flow Networks	2026	SIGMOD	5.093636e-05
10,528	Effective Durable Community Search in Large Temporal Graph	2026	VLDB	5.093636e-05
10,683	Bursting Flow Query on Large Temporal Flow Networks	2025	SIGMOD	5.093636e-05
10,758	Dupin: A Parallel Framework for Densest Subgraph Discovery in Fraud Detection on Massive Graphs	2025	SIGMOD	5.093636e-05
11,267	Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs	2024	VLDB	5.093636e-05

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
102	Truss Decomposition in Massive Networks	2012	VLDB	0.00034255289
1,018	Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification	2012	VLDB	0.0001263063
4,236	On Dense Pattern Mining in Graph Streams	2010	VLDB	6.8164649e-05
12,158	ALID: Scalable Dominant Cluster Detection	2015	VLDB	5.093636e-05

Semantically Similar Papers

#	Overall Rank	Paper	Year	Venue
1	10,807	In-depth Analysis of Densest Subgraph Discovery in a Unified Framework	2025	VLDB
2	9,072	Time-Topology Analysis	2021	VLDB
3	10,767	Integral Densest Subgraph Search on Directed Graphs	2025	SIGMOD
4	8,365	Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties	2022	SIGMOD
5	8,822	Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery	2023	SIGMOD
6	2,024	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB
7	3,737	Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs	2020	SIGMOD
8	6,635	Scalable Time-Range k-Core Query on Temporal Graphs	2023	VLDB
9	11,256	Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs	2024	VLDB
10	3,337	Mining Bursting Core in Large Temporal Graphs	2022	VLDB