On Querying Historical K-Cores
Summary: Index-based method for historical k-core queries on temporal graphs over a time window. Offers pruning to shrink index size and a linear-time construction algorithm, with experiments on real temporal graphs showing efficient queries. (summarized by gpt-5-nano on Feb 09 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Michael Yu
- 2. Dong Wen
- 3. Lu Qin
- 4. Ying Zhang
- 5. Wenjie Zhang
- 6. Xuemin Lin
Incoming Citations (Sorted by Pagerank)
Showing 18 of 18 citing papers.
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 7 of 7 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
| Rank | Cited Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 353 | Local Search of Communities in Large Graphs | 2014 | SIGMOD | 0.00026277992 |
| 966 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB | 0.00014960672 |
| 999 | Effective Community Search for Large Attributed Graphs | 2016 | VLDB | 0.00014726563 |
| 1,150 | K-Core Decomposition of Large Networks on a Single PC | 2016 | VLDB | 0.00013657353 |
| 3,603 | Skyline Community Search in Multi-valued Networks | 2018 | SIGMOD | 6.9306814e-05 |
| 3,639 | On Querying Historical Evolving Graph Sequences | 2011 | VLDB | 6.8913642e-05 |
| 6,207 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 5.1572428e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| Overall Rank | Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 5,854 | Diversified Top-k Subgraph Querying in a Large Graph | 2016 | SIGMOD | 5.3006473e-05 |
| 11,044 | Evolution Forest Index: Towards Optimal Temporal k-Core Component Search via Time-Topology Isomorphic Computation | 2024 | VLDB | 4.1945683e-05 |
| 3,321 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB | 7.223972e-05 |
| 11,748 | Durable Top-k Queries on Temporal Data | 2018 | VLDB | 4.1945683e-05 |
| 4,970 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD | 5.7945079e-05 |
| 10,232 | Efficient Temporal Subgraph Management: A New Interval Index | 2026 | VLDB | 4.1945683e-05 |
| 6,657 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD | 4.9720132e-05 |
| 11,042 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB | 4.1945683e-05 |
| 7,341 | Scalable Time-Range k-Core Query on Temporal Graphs | 2023 | VLDB | 4.7576413e-05 |
| 10,547 | On More Efficiently and Versatilely Querying Historical k-Cores | 2025 | VLDB | 4.1945683e-05 |