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
- 2. Rong-Hua Li
- 3. Ye Yuan
- 4. Guoren Wang
- 5. Lu Qin
- 6. Zhiwei Zhang
Incoming Citations (Sorted by Pagerank)
Showing 12 of 12 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 |
|---|---|---|---|---|
| 284 | Querying K-Truss Community in Large and Dynamic Graphs | 2014 | SIGMOD | 0.00029014359 |
| 682 | Finding Maximal Cliques in Massive Networks by H*-graph | 2010 | SIGMOD | 0.0001816451 |
| 1,650 | Efficient Enumeration of Maximal k-Plexes | 2015 | SIGMOD | 0.00011002771 |
| 1,837 | Distance-generalized Core Decomposition | 2019 | SIGMOD | 0.00010355705 |
| 2,043 | Local Algorithms for Hierarchical Dense Subgraph Discovery | 2019 | VLDB | 9.6970812e-05 |
| 3,369 | Online Density Bursting Subgraph Detection from Temporal Graphs | 2019 | VLDB | 7.1656755e-05 |
| 3,950 | COMMIT: A Scalable Approach to Mining Communication Motifs from Dynamic Networks | 2015 | SIGMOD | 6.5925643e-05 |
| 4,133 | On Querying Historical K-Cores | 2021 | VLDB | 6.4185206e-05 |
| 5,376 | Minimum Spanning Trees in Temporal Graphs | 2015 | SIGMOD | 5.5407342e-05 |
| 7,305 | Real Time Discovery of Dense Clusters in Highly Dynamic Graphs: Identifying Real World Events in Highly Dynamic Environments | 2012 | VLDB | 4.7627067e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 7,446 | QTCS: Efficient Query-Centered Temporal Community Search | 2024 | VLDB | 4.7232788e-05 |
| 7,339 | Scalable Time-Range k-Core Query on Temporal Graphs | 2023 | VLDB | 4.7530782e-05 |
| 8,920 | Time-Topology Analysis | 2021 | VLDB | 4.4229886e-05 |
| 10,323 | Efficient Temporal Edge-Core Maintenance in Streaming Graphs | 2026 | VLDB | 4.1905499e-05 |
| 7,305 | Real Time Discovery of Dense Clusters in Highly Dynamic Graphs: Identifying Real World Events in Highly Dynamic Environments | 2012 | VLDB | 4.7627067e-05 |
| 8,236 | Hunting Temporal Bumps in Graphs with Dynamic Vertex Properties | 2022 | SIGMOD | 4.5475127e-05 |
| 10,865 | Finding Time-Proximity Communities in Temporal Heterogeneous Information Networks | 2025 | VLDB | 4.1905499e-05 |
| 3,369 | Online Density Bursting Subgraph Detection from Temporal Graphs | 2019 | VLDB | 7.1656755e-05 |
| 10,408 | Bursting Flow Query on Large Temporal Flow Networks | 2025 | SIGMOD | 4.1905499e-05 |
| 10,240 | Effective Durable Community Search in Large Temporal Graph | 2026 | VLDB | 4.1905499e-05 |