A Simple Greedy Algorithm for Dynamic Graph Orientation

Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avisTidsskriftartikelForskningpeer review

DOI

Graph orientations with low out-degree are one of several ways to efficiently store sparse graphs. If the graphs allow for insertion and deletion of edges, one may have to flip the orientation of some edges to prevent blowing up the maximum out-degree. We use arboricity as our sparsity measure. With an immensely simple greedy algorithm, we get parametrized trade-off bounds between out-degree and worst case number of flips, which previously only existed for amortized number of flips. We match the previous best worst-case algorithm (in O(log n) flips) for almost all values of arboricity and beat it for either constant or super-logarithmic arboricity. We also match a previous best amortized result for at least logarithmic arboricity, and give the first results with worst-case O(1) and O(logn) flips nearly matching out-degree bounds to their respective amortized solutions.

OriginalsprogEngelsk
TidsskriftAlgorithmica
Vol/bind82
Nummer2
Sider (fra-til)245-259
Antal sider15
ISSN0178-4617
DOI
StatusUdgivet - feb. 2020

Se relationer på Aarhus Universitet Citationsformater

ID: 179024299