A new edge-centric binary forest index answers temporal k-core component queries with far smaller index size and much faster construction than the existing EF-Index.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Accelerating Historical K-Core Search in Temporal Graphs
A new edge-centric binary forest index answers temporal k-core component queries with far smaller index size and much faster construction than the existing EF-Index.