Fully Dynamic Graph Orientation

Abstract

In this thesis we consider the problem of edge orientation, where the goal is to orient the edges of an undirected dynamic graph with n vertices so that the out-degree of every vertex is bounded, typically by a function of the graph's arboricity.