A weight-preserving reduction from undirected 2-FRP to SSRP establishes their computational equivalence and yields matching improved algorithms for 2-FRP.
Finding level-ancestors in trees
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
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.
citing papers explorer
-
Undirected Replacement Paths: Dual Fault Reduces to Single Source
A weight-preserving reduction from undirected 2-FRP to SSRP establishes their computational equivalence and yields matching improved algorithms for 2-FRP.
-
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.