Maintaining dynamic minimum spanning trees: an experimental study
type: Item
instance of: scholarly article
title: Maintaining dynamic minimum spanning trees: an experimental study
zbMATH Open document ID: 1225.05080
author: B. E. Eshmatov
published in: Discrete Applied Mathematics
publication date: 2010-05-05T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5703743
zbMATH Keywords: experimental analysis
zbMATH Keywords: minimum spanning tree algorithms
zbMATH Keywords: dynamic graphs
describes a project that uses: LEDA
Wikidata QID: Q61609483
MaRDI profile type: Publication
full work available at URL: j.dam.2009.10.005
OpenAlex ID: W1990020944
cites work: Algorithmic aspects in speech recognition
cites work: Average-case analysis of dynamic graph algorithms
cites work: Maintaining information in fully dynamic trees with top trees
cites work: Q5501809
cites work: Randomized search trees
cites work: Paths in graphs
cites work: Speeding up dynamic shortest-path algorithms
cites work: Q4707794
cites work: Introduction to algorithms
cites work: Experimental analysis of dynamic all pairs shortest path algorithms
cites work: Fully dynamic all pairs shortest paths with real edge weights
cites work: Does Path Cleaning Help in Dynamic All-Pairs Shortest Paths?
cites work: A new approach to dynamic all pairs shortest paths
cites work: Sparsification—a technique for speeding up dynamic graph algorithms
cites work: Separator based sparsification. I: Planarity testing and minimum spanning trees
cites work: Separator-Based Sparsification II: Edge and Vertex Connectivity
cites work: Maintenance of a minimum spanning forest in a dynamic plane graph
cites work: Data Structures for On-Line Updating of Minimum Spanning Trees, with Applications
cites work: Ambivalent Data Structures for Dynamic 2-Edge-Connectivity and k Smallest Spanning Trees
cites work: Power balance and apportionment algorithms for the United States Congress
cites work: Q4252752
cites work: Randomized fully dynamic graph algorithms with polylogarithmic time per operation
cites work: Maintaining minimum spanning forests in dynamic graphs
cites work: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity
cites work: An Experimental Study of Polylogarithmic, Fully Dynamic, Connectivity Algorithms
cites work: A fully dynamic algorithm for maintaining the transitive closure
cites work: On the shortest spanning subtree of a graph and the traveling salesman problem
cites work: A data structure for dynamic trees
cites work: Self-adjusting binary search trees
DBLP publication ID: journals/dam/CattaneoFPI10
DOI: 10.1016/J.DAM.2009.10.005
description: scientific article; zbMATH DE number 5703743