scientific article; zbMATH DE number 7278017

DOI10.4230/LIPIcs.ISAAC.2017.12zbMath1457.68203MaRDI QIDQ5136228

Brodal Gerth Stølting, Edvin Berglin

Publication date: 25 November 2020

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

dynamic graph algorithmsedge orientationsgraph arboricity

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Fully dynamic MIS in uniformly sparse graphs ⋮ Fully dynamic arboricity maintenance ⋮ Improved Dynamic Graph Coloring

Cites Work

• Unnamed Item
• Adjacency queries in dynamic sparse graphs
• A balanced search tree O(1) worst-case update time
• Orienting Dynamic Graphs, with Applications to Maximal Matchings and Adjacency Queries
• Fully Dynamic Matching in Bipartite Graphs
• Implicat Representation of Graphs
• Faster Fully Dynamic Matchings with Small Approximation Ratios
• Dynamic (1 + ∊)-Approximate Matchings: A Density-Sensitive Approach
• Simple Deterministic Algorithms for Fully Dynamic Maximal Matching
• Orienting Fully Dynamic Graphs with Worst-Case Time Bounds

This page was built for publication: