First fully dynamic algorithm maintains loop nesting forests in reducible flow graphs via local updates to depth-first spanning trees.
Title resolution pending
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
-
Fully Dynamic Maintenance of Loop Nesting Forests in Reducible Flow Graphs
First fully dynamic algorithm maintains loop nesting forests in reducible flow graphs via local updates to depth-first spanning trees.