Mining Bursting Core in Large Temporal Graphs
Summary: Defines (l, delta)-maximal bursting core: a temporal subgraph with each node's average degree ≥ delta in a time segment of length at least l, capturing bursting communities in temporal graphs. Develops DP to compute segment density in O(|T|), O(l) updates, and non-dominated core enumeration; experiments on 9 real datasets show effectiveness, efficiency, and scalability. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Hongchao Qin (Beijing Institute of Technology)
- 2. Rong-Hua Li (Beijing Institute of Technology)
- 3. Ye Yuan (Beijing Institute of Technology)
- 4. Guoren Wang (Beijing Institute of Technology)
- 5. Lu Qin (University of Technology Sydney)
- 6. Zhiwei Zhang (Beijing Institute of Technology)
BibTeX Citation
@article{qin_vldb22,
title = {{Mining Bursting Core in Large Temporal Graphs}},
author = {Qin, Hongchao and Li, Rong-Hua and Yuan, Ye and Wang, Guoren and Qin, Lu and Zhang, Zhiwei},
journal = {PVLDB},
series = {{VLDB} '22},
volume = {15},
number = {13},
pages = {3911--3923},
doi = {10.14778/3565838.3565845},
url = {https://doi.org/10.14778/3565838.3565845},
year = {2022}
}Incoming Citations (Sorted by Pagerank)
Showing 14 of 14 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 10 of 10 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 189 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00026114928 |
| 674 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.00015081844 |
| 1,416 | Local Algorithms for Hierarchical Dense Subgraph Discovery | 2019 | VLDB | 0.00010839488 |
| 1,633 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00010164289 |
| 1,640 | Distance-generalized Core Decomposition | 2019 | SIGMOD | 0.00010153865 |
| 2,896 | Online Density Bursting Subgraph Detection from Temporal Graphs | 2019 | VLDB | 7.9828452e-05 |
| 3,312 | On Querying Historical K-Cores | 2021 | VLDB | 7.5309892e-05 |
| 3,439 | COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks | 2015 | SIGMOD | 7.4144782e-05 |
| 5,028 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD | 6.3961072e-05 |
| 7,277 | Real Time Discovery of Dense Clusters in Highly Dynamic Graphs: Identifying Real World Events in Highly Dynamic Environments | 2012 | VLDB | 5.6581746e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 6,635 | Scalable Time-Range k-Core Query on Temporal Graphs | 2023 | VLDB |
| 2 | 9,072 | Time-Topology Analysis | 2021 | VLDB |
| 3 | 10,609 | Efficient Temporal Edge-Core Maintenance in Streaming Graphs | 2026 | VLDB |
| 4 | 7,277 | Real Time Discovery of Dense Clusters in Highly Dynamic Graphs: Identifying Real World Events in Highly Dynamic Environments | 2012 | VLDB |
| 5 | 8,365 | Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties | 2022 | SIGMOD |
| 6 | 11,085 | Finding Time-Proximity Communities in Temporal Heterogeneous Information Networks | 2025 | VLDB |
| 7 | 2,896 | Online Density Bursting Subgraph Detection from Temporal Graphs | 2019 | VLDB |
| 8 | 10,683 | Bursting Flow Query on Large Temporal Flow Networks | 2025 | SIGMOD |
| 9 | 10,280 | Periodic Community Search in Temporal Graphs: Time Series-based Methods | 2026 | SIGMOD |
| 10 | 10,528 | Effective Durable Community Search in Large Temporal Graph | 2026 | VLDB |