Data structures achieve O(log* n) per operation for tree-sum queries on decremental forests using micro-macro decomposition, plus a universally optimal algorithm in the group model.
Hopcroft and Jeffrey D
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Fast decremental tree sums in forests
Data structures achieve O(log* n) per operation for tree-sum queries on decremental forests using micro-macro decomposition, plus a universally optimal algorithm in the group model.