A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Orienting Fully Dynamic Graphs with Worst-Case Time Bounds
[chapter]
2014
Lecture Notes in Computer Science
In edge orientations, the goal is usually to orient (direct) the edges of an undirected network (modeled by a graph) such that all outdegrees are bounded. When the network is fully dynamic, i.e., admits edge insertions and deletions, we wish to maintain such an orientation while keeping a tab on the update time. Low out-degree orientations turned out to be a surprisingly useful tool for managing networks. Brodal and Fagerberg (1999) initiated the study of the edge orientation problem in terms
doi:10.1007/978-3-662-43951-7_45
fatcat:6bdclqiimzemndbi4fagav7cbm