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: 11957
Venue: VLDB
Year: 2019
Pagerank: 7.1656755e-05
Overall Rank: 3,369 | 76.59%
DOI: 10.14778/3358701.3358704

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 12 of 12 citing papers.

Rank	Citing Paper	Year	Venue	Pagerank
4,209	Mining Bursting Core in Large Temporal Graphs	2022	VLDB	6.3511029e-05
7,339	Scalable Time-Range k-Core Query on Temporal Graphs	2023	VLDB	4.7530782e-05
7,446	QTCS: Efficient Query-Centered Temporal Community Search	2024	VLDB	4.7232788e-05
8,236	Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties	2022	SIGMOD	4.5475127e-05
9,040	RUSH: Real-time Burst Subgraph Detection in Dynamic Graphs	2024	VLDB	4.3997447e-05
10,135	ABFlow: Alert Bursting Flow Query in Streaming Temporal Flow Networks	2026	SIGMOD	4.1905499e-05
10,240	Effective Durable Community Search in Large Temporal Graph	2026	VLDB	4.1905499e-05
10,408	Bursting Flow Query on Large Temporal Flow Networks	2025	SIGMOD	4.1905499e-05
10,489	Dupin: A Parallel Framework for Densest Subgraph Discovery in Fraud Detection on Massive Graphs	2025	SIGMOD	4.1905499e-05
10,556	On More Efficiently and Versatilely Querying Historical k-Cores	2025	VLDB	4.1905499e-05
11,047	Evolution Forest Index: Towards Optimal Temporal k-Core Component Search via Time-Topology Isomorphic Computation	2024	VLDB	4.1905499e-05
11,063	Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs	2024	VLDB	4.1905499e-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
106	Truss Decomposition in Massive Networks	2012	VLDB	0.00048373761
1,029	Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification	2012	VLDB	0.00014568714
4,092	On Dense Pattern Mining in Graph Streams [Extended Abstract]	2010	VLDB	6.4525563e-05
11,968	ALID: Scalable Dominant Cluster Detection	2015	VLDB	4.1905499e-05

Semantically Similar Papers

Overall Rank	Paper	Year	Venue	Pagerank
10,544	In-depth Analysis of Densest Subgraph Discovery in a Unified Framework	2025	VLDB	4.1905499e-05
8,920	Time-Topology Analysis	2021	VLDB	4.4229886e-05
10,500	Integral Densest Subgraph Search on Directed Graphs	2025	SIGMOD	4.1905499e-05
8,236	Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties	2022	SIGMOD	4.5475127e-05
9,652	Efficient and Effective Algorithms for Generalized Densest Subgraph Discovery	2023	SIGMOD	4.3067693e-05
2,913	Efficient Algorithms for Densest Subgraph Discovery	2019	VLDB	7.9229304e-05
4,341	Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs	2020	SIGMOD	6.268429e-05
7,339	Scalable Time-Range k-Core Query on Temporal Graphs	2023	VLDB	4.7530782e-05
11,051	Efficient Algorithms for Density Decomposition on Large Static and Dynamic Graphs	2024	VLDB	4.1905499e-05
4,209	Mining Bursting Core in Large Temporal Graphs	2022	VLDB	6.3511029e-05