Preprint
Aug 2026
Dynamic Edge Orientation via Random Walks: From Trees to Outerplanar Graphs and Beyond
The algorithm maintains constant outdegree with $O(\log n)$ worst-case update time, where the time bound holds in expectation, and also with high probability for polynomially long update sequences.
Gabriel Marques Domingues, Minh Hang Nguyen, Shay Solomon
· 0 citations