Scalable Time-Range k-Core Query on Temporal Graphs
Summary: Introduces Temporal k-Core Query, retrieving distinct k-cores over all subintervals. OTCD uses decremental decomposition and tightest-time-interval pruning for span-independent scalability, backed by dynamic, bounded-memory Temporal Edge Lists; up to 3 orders faster without indexes. (summarized by gpt-5.6-luna on Jul 24 2026)
Incoming Non-self Citations Over Time
Authors
- 1. Junyong Yang (Wuhan University)
- 2. Ming Zhong (Wuhan University)
- 3. Yuanyuan Zhu (Wuhan University)
- 4. Tieyun Qian (Wuhan University)
- 5. Mengchi Liu (South China Normal University)
- 6. Jeffrey Xu Yu (Chinese University of Hong Kong)
BibTeX Citation
@article{yang_vldb23,
title = {{Scalable Time-Range k-Core Query on Temporal Graphs}},
author = {Yang, Junyong and Zhong, Ming and Zhu, Yuanyuan and Qian, Tieyun and Liu, Mengchi and Yu, Jeffrey Xu},
journal = {PVLDB},
series = {{VLDB} '23},
volume = {16},
number = {5},
pages = {1168--1180},
doi = {10.14778/3579075.3579089},
url = {https://doi.org/10.14778/3579075.3579089},
year = {2023}
}Incoming Citations (Sorted by Pagerank)
Showing 8 of 8 citing papers.
| Rank | Citing Paper | Year | Venue | Pagerank |
|---|---|---|---|---|
| 8,149 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB | 5.4784885e-05 |
| 8,504 | Enabling Window-Based Monotonic Graph Analytics with Reusable Transitional Results for Pattern-Consistent Queries | 2024 | VLDB | 5.4132367e-05 |
| 8,718 | Evolution Forest Index: Towards Optimal Temporal k-Core Component Search via Time-Topology Isomorphic Computation | 2024 | VLDB | 5.3774243e-05 |
| 8,812 | On More Efficiently and Versatilely Querying Historical k-Cores | 2025 | VLDB | 5.3652966e-05 |
| 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD | 5.093636e-05 |
| 10,520 | Efficient Temporal Subgraph Management: A New Interval Index | 2026 | VLDB | 5.093636e-05 |
| 10,528 | Effective Durable Community Search in Large Temporal Graph | 2026 | VLDB | 5.093636e-05 |
| 11,085 | Finding Time-Proximity Communities in Temporal Heterogeneous Information Networks | 2025 | VLDB | 5.093636e-05 |
Previous
Page 1 / 1
Next
Outgoing Citations (Sorted by Pagerank)
Showing 12 of 12 cited papers.
Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.
Previous
Page 1 / 1
Next
Semantically Similar Papers
| # | Overall Rank | Paper | Year | Venue |
|---|---|---|---|---|
| 1 | 8,718 | Evolution Forest Index: Towards Optimal Temporal k-Core Component Search via Time-Topology Isomorphic Computation | 2024 | VLDB |
| 2 | 10,280 | Periodic Community Search in Temporal Graphs: Time Series-based Methods | 2026 | SIGMOD |
| 3 | 10,528 | Effective Durable Community Search in Large Temporal Graph | 2026 | VLDB |
| 4 | 6,075 | On Querying Historical Connectivity in Temporal Graphs | 2024 | SIGMOD |
| 5 | 3,836 | On Querying Connected Components in Large Temporal Graphs | 2023 | SIGMOD |
| 6 | 10,520 | Efficient Temporal Subgraph Management: A New Interval Index | 2026 | VLDB |
| 7 | 8,149 | Efficient Index for Temporal Core Queries over Bipartite Graphs | 2024 | VLDB |
| 8 | 10,283 | Querying Cohesive Subgraphs in Temporal Graphs | 2026 | SIGMOD |
| 9 | 8,812 | On More Efficiently and Versatilely Querying Historical k-Cores | 2025 | VLDB |
| 10 | 3,312 | On Querying Historical K-Cores | 2021 | VLDB |