Fully-dynamic minimum spanning forest with improved worst-case update time
From MaRDI portal
Publication:4978053
DOI10.1145/3055399.3055415zbMath1370.68238arXiv1611.02864OpenAlexW2565540516MaRDI QIDQ4978053
Publication date: 17 August 2017
Published in: Proceedings of the 49th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1611.02864
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Data structures (68P05) Connectivity (05C40)
Related Items (7)
Faster connectivity in low-rank hypergraphs via expander decomposition ⋮ Decremental SPQR-trees for Planar Graphs ⋮ Constructing Light Spanners Deterministically in Near-Linear Time ⋮ Constant-time dynamic weight approximation for minimum spanning forest ⋮ Dynamic DFS in Undirected Graphs: Breaking the $O(m)$ Barrier ⋮ Constructing light spanners deterministically in near-linear time ⋮ Improved Dynamic Graph Coloring
This page was built for publication: Fully-dynamic minimum spanning forest with improved worst-case update time
