Maintaining minimum spanning trees in dynamic graphs
From MaRDI portal
Recommendations
- Maintaining minimum spanning forests in dynamic graphs
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- Maintenance of a minimum spanning forest in a dynamic plane graph
- scientific article; zbMATH DE number 1263228
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
Cites work
- A data structure for dynamic trees
- A linear-time algorithm for finding a sparse \(k\)-connected spanning subgraph of a \(k\)-connected graph
- Algorithms and Data Structures for an Expanded Family of Matroid Intersection Problems
- An On-Line Edge-Deletion Problem
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Dynamic Euclidean minimum spanning trees and extrema of binary functions
- scientific article; zbMATH DE number 3887059 (Why is no real title available?)
- scientific article; zbMATH DE number 1256641 (Why is no real title available?)
- scientific article; zbMATH DE number 1263228 (Why is no real title available?)
- scientific article; zbMATH DE number 2102755 (Why is no real title available?)
- Separator based sparsification for dynamic planar graph algorithms
Cited in
(35)- Reoptimization of minimum and maximum traveling salesman's tours
- Maintaining regular properties dynamically in k-terminal graphs
- Partially dynamic maintenance of minimum weight hyperpaths
- Constant-time dynamic weight approximation for minimum spanning forest
- How to use spanning trees to navigate in graphs
- Fully dynamic all pairs shortest paths with real edge weights
- scientific article; zbMATH DE number 1617242 (Why is no real title available?)
- scientific article; zbMATH DE number 1670672 (Why is no real title available?)
- Maintaining minimum spanning forests in dynamic graphs
- Fully dynamically maintaining minimal integral separator for threshold and difference graphs
- A survey on combinatorial optimization in dynamic environments
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- Optimal maintenance of a spanning tree
- Maintaining Nets and Net Trees under Incremental Motion
- Reoptimization of maximum weight induced hereditary subgraph problems
- Maintenance of a minimum spanning forest in a dynamic plane graph
- scientific article; zbMATH DE number 177564 (Why is no real title available?)
- scientific article; zbMATH DE number 1263228 (Why is no real title available?)
- Offline Algorithms for Dynamic Minimum Spanning Tree Problems
- scientific article; zbMATH DE number 1775391 (Why is no real title available?)
- Minimizing diameters of dynamic trees
- The saga of minimum spanning trees
- Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations
- Maintaining spanning trees of small diameter
- scientific article; zbMATH DE number 1926664 (Why is no real title available?)
- Fully Dynamic Algorithms for Maintaining Shortest Paths Trees
- Fully-dynamic minimum spanning forest with improved worst-case update time
- Updating Directed Minimum Cost Spanning Trees
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Competitive Maintenance of Minimum Spanning Trees in Dynamic Graphs
- A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges
- On partitioning minimum spanning trees
- Maximum core spanning tree maintenance for large dynamic graphs
- Maintaining dynamic minimum spanning trees: an experimental study
- Fast reoptimization for the minimum spanning tree problem
This page was built for publication: Maintaining minimum spanning trees in dynamic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571989)
