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

Full description

Bibliographic Details

Published in:	Algorithmica Vol. 82; no. 2; pp. 245 - 259
Main Authors:	Berglin, Edvin, Brodal, Gerth Stølting
Format:	Journal Article
Language:	English
Published:	New York Springer US 01.02.2020 Springer Nature B.V
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!