First parallel batch-dynamic data structures with worst-case, not merely amortized, polylogarithmic work and depth per batch for approximate coreness, density, arboricity, and low out-degree orientation.
Large scale networks fingerprinting and visualization using the k-core decomposition
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Parallel Batch-Dynamic Coreness Decomposition with Worst-Case Guarantees
First parallel batch-dynamic data structures with worst-case, not merely amortized, polylogarithmic work and depth per batch for approximate coreness, density, arboricity, and low out-degree orientation.