Open access
2026
Fully dynamic strong connectivity and reachability in digraphs
A deterministic fully dynamic algorithm that simultaneously maintains SCCs and reachability in directed graphs and significantly outperforms repeated offline recomputation in practical scenarios is presented.
Gregory Morse, Tamás Kozsik
· Annales Mathematicae et Info... · 0 citations