A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2021; you can also visit the original URL.
The file type is
For any forest G = (V, E) it is possible to orient the edges E so that no vertex in V has out-degree greater than 1. This paper considers the incremental edge-orientation problem, in which the edges E arrive over time and the algorithm must maintain a low-out-degree edge orientation at all times. We give an algorithm that maintains a maximum out-degree of 3 while flipping at most O(loglog n) edge orientations per edge insertion, with high probability in n. The algorithm requires worst-case timearXiv:2107.02318v1 fatcat:v2y4ez3wcvaa3mdjf3iueh5kwq