A Simple Greedy Algorithm for Dynamic Graph Orientation

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...

Celý popis

Podrobná bibliografia

Vydané v:	Algorithmica Ročník 82; číslo 2; s. 245 - 259
Hlavní autori:	Berglin, Edvin, Brodal, Gerth Stølting
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	New York Springer US 01.02.2020 Springer Nature B.V
Predmet:	Algorithm Analysis and Problem Complexity Algorithms Computer Science Computer Systems Organization and Communication Networks Data Structures and Information Theory Graphs Greedy algorithms Mathematics of Computing Special Issue: Algorithms and Computation Theory of Computation Graph arboricity Edge orientations Dynamic graph algorithms
ISSN:	0178-4617, 1432-0541
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!