7 citations · 10 across the 7 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2026
Fully Dynamic Maintenance of Loop Nesting Forests in Reducible Flow Graphs
Gregory Morse, Tamás Kozsik
Loop nesting forests (LNFs) are a fundamental abstraction for reasoning about control-flow structure, enabling applications such as compiler optimizations, program analysis, and do…
cs.DS2026
Fully Dynamic Breadth First Search and Spanning Trees in Directed Graphs
Gregory Morse, Tamás Kozsik
We study the problem of maintaining a breadth-first spanning tree and the induced BFS ordering in a directed graph under edge updates. While semi-dynamic algorithms are known, main…