CoreT answers all temporal k-core queries over a time interval in a single pass by maintaining k-core entry times, with claimed complexity O(Δ·|E|) and up to 10,000x speedups.
Efficient temporal core maintenance of massive graphs,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Temporal $k$-Core Query, Revisited
CoreT answers all temporal k-core queries over a time interval in a single pass by maintaining k-core entry times, with claimed complexity O(Δ·|E|) and up to 10,000x speedups.