A simple greedy algorithm for dynamic graph orientation
type: Item
instance of: scholarly article
title: A simple greedy algorithm for dynamic graph orientation
zbMATH Open document ID: 1433.68278
author: Edvin Berglin
author: Gerth Stølting Brodal
published in: Algorithmica
publication date: 2020-04-09T00:00:00Z
full work available at URL: https://drops.dagstuhl.de/opus/volltexte/2017/8263/
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68W40
zbMATH DE Number: 7188809
zbMATH Keywords: dynamic graph algorithms
zbMATH Keywords: graph arboricity
zbMATH Keywords: edge orientations
MaRDI profile type: Publication
OpenAlex ID: W2900862090
cites work: Fully Dynamic Matching in Bipartite Graphs
cites work: Faster Fully Dynamic Matchings with Small Approximation Ratios
cites work: Q3024792
cites work: Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries
cites work: Implicat Representation of Graphs
cites work: Orienting Fully Dynamic Graphs with Worst-Case Time Bounds
cites work: Adjacency queries in dynamic sparse graphs
cites work: A balanced search tree O(1) worst-case update time
cites work: Simple Deterministic Algorithms for Fully Dynamic Maximal Matching
cites work: Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach
Wikidata QID: Q128908560
DOI: 10.1007/S00453-018-0528-0
description: scientific article; zbMATH DE number 7188809