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 (University of New South Wales)
- 2. Dong Wen (University of Technology Sydney)
- 3. Lu Qin (University of Technology Sydney)
- 4. Ying Zhang (University of Technology Sydney)
- 5. Wenjie Zhang (University of New South Wales)
- 6. Xuemin Lin (University of New South Wales)
BibTeX Citation
@article{yu_vldb21,
title = {{On Querying Historical K-Cores}},
author = {Yu, Michael and Wen, Dong and Qin, Lu and Zhang, Ying and Zhang, Wenjie and Lin, Xuemin},
journal = {PVLDB},
series = {{VLDB} '21},
volume = {14},
number = {11},
pages = {2033--2045},
doi = {10.14778/3476249.3476260},
url = {https://doi.org/10.14778/3476249.3476260},
year = {2021}
}
Incoming Citations (Sorted by Pagerank)
Showing 23 of 23 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 |
|---|---|---|---|---|
| 276 | Local Search of Communities in Large Graphs | 2014 | SIGMOD | 0.00022377798 |
| 696 | Effective Community Search for Large Attributed Graphs | 2016 | VLDB | 0.00014671367 |
| 732 | Streaming Algorithms for k-core Decomposition | 2013 | VLDB | 0.00014341313 |
| 829 | K-Core Decomposition of Large Networks on a Single PC | 2016 | VLDB | 0.00013587885 |
| 3,221 | Skyline Community Search in Multi-valued Networks | 2018 | SIGMOD | 7.5060153e-05 |
| 3,665 | On Querying Historical Evolving Graph Sequences | 2011 | VLDB | 7.0996773e-05 |
| 4,567 | Efficiently Computing k-Edge Connected Components via Graph Decomposition | 2013 | SIGMOD | 6.5173666e-05 |
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 2,873 | Hierarchical Core Maintenance on Large Dynamic Graphs | 2021 | VLDB |
| 2 | 12,301 | Durable Top-k Queries on Temporal Data | 2018 | VLDB |
| 3 | 10,394 | Effective Structurally Similar Community Search in Large Temporal Graphs | 2027 | SIGMOD |
| 4 | 3,928 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD |
| 5 | 10,776 | Efficient Temporal Subgraph Management: A New Interval Index | 2026 | VLDB |
| 6 | 6,209 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |
| 7 | 8,339 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB |
| 8 | 10,572 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD |
| 9 | 6,505 | Scalable Time-Range k-Core Query on Temporal Graphs | 2023 | VLDB |
| 10 | 8,536 | On More Efficiently and Versatilely Querying Historical k-Cores | 2025 | VLDB |