Faster Deterministic Fully-Dynamic Graph Connectivity
From MaRDI portal
Publication:5741835
DOI10.1137/1.9781611973105.126zbMath1422.68199arXiv1209.5608OpenAlexW2953105294MaRDI QIDQ5741835
Publication date: 15 May 2019
Published in: Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1209.5608
Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05) Connectivity (05C40)
Related Items (13)
Spatial mixing and the random‐cluster dynamics on lattices ⋮ Listing the bonds of a graph in \(\widetilde{O} (n)\)-delay ⋮ Optimal decremental connectivity in planar graphs ⋮ Dynamic connectivity in disk graphs ⋮ Deterministic Fault-Tolerant Connectivity Labeling Scheme ⋮ Single-Source Shortest Paths and Strong Connectivity in Dynamic Planar Graphs. ⋮ Decremental SPQR-trees for Planar Graphs ⋮ Reliable Hubs for Partially-Dynamic All-Pairs Shortest Paths in Directed Graphs ⋮ Constant-time dynamic weight approximation for minimum spanning forest ⋮ Single-source shortest paths and strong connectivity in dynamic planar graphs ⋮ Connectivity Oracles for Graphs Subject to Vertex Failures ⋮ Fully Dynamic Connectivity Oracles under General Vertex Updates ⋮ Decremental Strongly Connected Components and Single-Source Reachability in Near-Linear Time
This page was built for publication: Faster Deterministic Fully-Dynamic Graph Connectivity
