Offline Algorithms for Dynamic Minimum Spanning Tree Problems

DOI10.1006/JAGM.1994.1033MaRDI QIDQ4312223zbMATH OpenOpenAlexFDO

Authors David Eppstein

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

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• scientific article; zbMATH DE number 177564
• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• Incremental minimum spanning tree algorithms
• Maintaining minimum spanning trees in dynamic graphs
• Exact Algorithms for the Minimum Load Spanning Tree Problem
• Computational Methods for Minimum Spanning Tree Algorithms
• Faster Fully-Dynamic Minimum Spanning Forest
• Online minimum spanning tree with advice (extended abstract)
• On the simultaneous minimum spanning trees problem
• Constant-time dynamic weight approximation for minimum spanning forest

Cited in

(9)

• Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
• Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
• scientific article; zbMATH DE number 1471729 (Why is no real title available?)
• A fast algorithm for data collection along a fixed track
• scientific article; zbMATH DE number 177564 (Why is no real title available?)
• A deterministic \(O(m \log {m})\) time algorithm for the Reeb graph
• Multiple-edge-fault-tolerant approximate shortest-path trees
• scientific article; zbMATH DE number 1670672 (Why is no real title available?)
• A simple rounding scheme for multistage optimization

This page was built for publication: Offline Algorithms for Dynamic Minimum Spanning Tree Problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4312223)