Database Paper Browser

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
13801
Venue
VLDB
Year
2025
Pagerank
4.1945683e-05
Overall Rank
10,547 | 26.63%
DOI
10.14778/3718057.3718063

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
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