Skip to content

Author

Gregory Morse

1 paper indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

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 · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.