Maintaining dynamic minimum spanning trees: an experimental study
From MaRDI portal
Publication:968158
DOI10.1016/J.DAM.2009.10.005zbMATH Open1225.05080DBLPjournals/dam/CattaneoFPI10OpenAlexW1990020944WikidataQ61609483 ScholiaQ61609483MaRDI QIDQ968158FDOQ968158
Authors: B. E. Eshmatov 
Publication date: 5 May 2010
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2009.10.005
Recommendations
Cites Work
- On the shortest spanning subtree of a graph and the traveling salesman problem
- Introduction to algorithms
- A data structure for dynamic trees
- Paths in graphs
- A new approach to dynamic all pairs shortest paths
- Self-adjusting binary search trees
- Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
- Maintenance of a minimum spanning forest in a dynamic plane graph
- Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
- Maintaining information in fully dynamic trees with top trees
- Sparsification—a technique for speeding up dynamic graph algorithms
- Randomized search trees
- Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
- Randomized fully dynamic graph algorithms with polylogarithmic time per operation
- Experimental analysis of dynamic all pairs shortest path algorithms
- Speeding up dynamic shortest-path algorithms
- Title not available (Why is that?)
- Fully dynamic all pairs shortest paths with real edge weights
- An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms
- A fully dynamic algorithm for maintaining the transitive closure
- Average-case analysis of dynamic graph algorithms
- Maintaining minimum spanning forests in dynamic graphs
- Separator based sparsification. I: Planarity testing and minimum spanning trees
- Separator-Based Sparsification II: Edge and Vertex Connectivity
- Algorithmic aspects in speech recognition
- Title not available (Why is that?)
- Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths?
- Power balance and apportionment algorithms for the United States Congress
- Title not available (Why is that?)
Cited In (6)
- Title not available (Why is that?)
- A Simple and Efficient Algorithm for Finding Minimum Spanning Tree Replacement Edges
- Dynamic maintenance of a shortest-path tree on homogeneous batches of updates: new algorithms and experiments
- Maintenance of a Spanning Tree For Dynamic Graphs by Mobile Agents and Local Computations
- Maintaining Nets and Net Trees under Incremental Motion
- Title not available (Why is that?)
Uses Software
This page was built for publication: Maintaining dynamic minimum spanning trees: an experimental study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q968158)
