Database Paper Browser

Back to papers

Scalable Time-Range k-Core Query on Temporal Graphs

Summary: Defines Temporal k-Core Query: enumerate distinct k-cores across any subinterval of a query interval, confronting quadratic subinterval blowup. Introduces decremental Temporal Core Decomposition with Tightest Time Interval pruning to make OTCD output‑sensitive and a compact Temporal Edge List, yielding index‑free ~1000× speedups. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
12985
Venue
VLDB
Year
2023
Pagerank
4.7576413e-05
Overall Rank
7,341 | 48.94%
DOI
10.14778/3579075.3579089

Incoming Non-self Citations Over Time

Authors

Incoming Citations (Sorted by Pagerank)

Showing 7 of 7 citing papers.

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