DBScholar

Back to papers

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)

Paper ID
12572
Venue
VLDB
Year
2021
Pagerank
7.5309892e-05
Overall Rank
3,312 | 77.28%
DOI
10.14778/3476249.3476260

Incoming Non-self Citations Over Time

Authors

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 21 of 21 citing papers.

Rank Citing Paper Year Venue Pagerank
3,337 Mining Bursting Core in Large Temporal Graphs 2022 VLDB 7.5072753e-05
3,836 On Querying Connected Components in Large Temporal Graphs 2023 SIGMOD 7.0827068e-05
6,075 On Querying Historical Connectivity in Temporal Graphs 2024 SIGMOD 5.9853864e-05
6,156 QTCS: Efficient Query-Centered Temporal Community Search 2024 VLDB 5.9560993e-05
6,617 Efficient Parallel D-core Decomposition at Scale 2024 VLDB 5.8212982e-05
6,635 Scalable Time-Range k-Core Query on Temporal Graphs 2023 VLDB 5.8174952e-05
6,937 Querying Structural Diversity in Streaming Graphs 2024 VLDB 5.7348103e-05
8,149 Efficient Index for Temporal Core Queries over Bipartite Graphs 2024 VLDB 5.4784885e-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
9,301 Accelerating Core Decomposition in Billion-Scale Hypergraphs 2025 SIGMOD 5.289545e-05
9,916 Efficient Historical Butterfly Counting in Large Temporal Bipartite Networks via Graph Structure-aware Index 2025 VLDB 5.1955087e-05
10,266 Maintaining Biconnected Components in Streaming Graphs 2026 SIGMOD 5.093636e-05
10,273 Nucleus Decomposition Revisited: An Efficient Counting-Based Approach 2026 SIGMOD 5.093636e-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
10,609 Efficient Temporal Edge-Core Maintenance in Streaming Graphs 2026 VLDB 5.093636e-05
10,671 Minimum Spanning Tree Maintenance in Dynamic Graphs 2025 SIGMOD 5.093636e-05
10,683 Bursting Flow Query on Large Temporal Flow Networks 2025 SIGMOD 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 7 of 7 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