A simple greedy algorithm for dynamic graph orientation

Publikation: Forskning - peer reviewKonferencebidrag i proceedings

Dokumenter

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 general 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(sqrt(log n)) flips nearly matching degree bounds to their respective amortized solutions.
OriginalsprogEngelsk
Titel28th International Symposium on Algorithms and Computation (ISAAC 2017)
RedaktørerYoshio Okamoto , Takeshi Tokuyama
Antal sider11
ForlagSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Udgivelsesår2017
Sider12:1-12:12
ISBN (Elektronisk)978-3-95977-054-5
DOI
StatusUdgivet - 2017
Begivenhed28th International Symposium on Algorithms and Computation - Cape Panwa Hotel, Phuket, Thailand
Varighed: 9 dec. 201712 dec. 2017
Konferencens nummer: 28
https://saki.siit.tu.ac.th/isaac2017/

Konference

Konference28th International Symposium on Algorithms and Computation
Nummer28
LokationCape Panwa Hotel
LandThailand
ByPhuket
Periode09/12/201712/12/2017
Internetadresse
SerieLeibniz International Proceedings in Informatics
Nummer92
ISSN1868-8969

Se relationer på Aarhus Universitet Citationsformater

ID: 120486564