Offline Algorithms for Dynamic Minimum Spanning Tree Problems
From MaRDI portal
Publication:4312223
DOI10.1006/jagm.1994.1033zbMath1427.68239OpenAlexW2038728802MaRDI QIDQ4312223
Publication date: 22 November 1995
Published in: Journal of Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jagm.1994.1033
Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph ⋮ Unnamed Item ⋮ A fast algorithm for data collection along a fixed track ⋮ Multiple-edge-fault-tolerant approximate shortest-path trees ⋮ A simple rounding scheme for multistage optimization
