DBScholar

Back to papers

On More Efficiently and Versatilely Querying Historical k-Cores

Summary: 'Core time shell' and MCTS-index expose hierarchical core-time structure to avoid full-vertex scans, yielding approximately optimal historical k-core query time with PHC-like space. MCTS also enables a novel 'when' query and empirically outperforms PHC. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
13989
Venue
VLDB
Year
2025
Pagerank
5.3652966e-05
Overall Rank
8,812 | 39.55%
DOI
10.14778/3718057.3718063

Incoming Non-self Citations Over Time

Authors

BibTeX Citation

@article{wang_vldb25,
        title = {{On More Efficiently and Versatilely Querying Historical k-Cores}},
        author = {Wang, Zhi and Zhong, Ming and Zhu, Yuanyuan and Qian, Tieyun and Liu, Mengchi and Yu, Jeffrey Xu},
        journal = {PVLDB},
        series = {{VLDB} '25},
        volume = {18},
        number = {5},
        pages = {1335--1347},
        doi = {10.14778/3718057.3718063},
        url = {https://doi.org/10.14778/3718057.3718063},
        year = {2025}
}

Incoming Citations (Sorted by Pagerank)

Showing 2 of 2 citing papers.

Rank Citing Paper Year Venue Pagerank
10,266 Maintaining Biconnected Components in Streaming Graphs 2026 SIGMOD 5.093636e-05
10,283 Querying Cohesive Subgraphs in Temporal Graphs 2026 SIGMOD 5.093636e-05
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 13 of 13 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