Skip to search formSkip to main contentSkip to account menu

Minimum spanning tree

Known as: Minimal spanning tree, Minimum spanning trees, Minimum weight spanning forest 
A minimum spanning tree (MST) or minimum weight spanning tree is a subset of the edges of a connected, edge-weighted undirected graph that connects… 
Wikipedia (opens in a new tab)

Related topics

Related topics

50 relations
Broadcasting (networking)Brute-force searchCartesian treeCircuit design

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2011
Highly Cited
2011
Stochastic minimum spanning trees in euclidean spaces
We study the complexity of geometric minimum spanning trees under a stochastic model of input: Suppose we are given a master set… 
2008
2008
Energy-optimal distributed algorithms for minimum spanning trees
Traditionally, the performance of distributed algorithms has been measured in terms of time and message complexity.Message… 
2006
2006
Bounded-degree minimum spanning trees
In this lecture, we consider a basic problem in network design, namely the minimum cost spanning tree problem with the… 
Highly Cited
2004
Highly Cited
2004
Engineering an External Memory Minimum Spanning Tree Algorithm
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than… 
2003
2003
Sublinear-time approximation of Euclidean minimum spanning tree
We consider the problem of finding the weight of a Euclidean minimum spanning tree for a set of n points in ℝd. We focus on the… 
2002
2002
Parallel Algorithms for Minimum Spanning Tree Problem
Two parallel algorithms are presented for solving the minimum cost spanning tree problem in any undirected graph. These… 
2001
2001
Reconstructing a Minimum Spanning Tree after Deletion of Any Node
AbstractAbstract. Updating a minimum spanning tree (MST) is a basic problem for communication networks. In this paper we consider… 
2000
2000
Minimum Spanning Tree
The minimum spanning tree of a weighted graph is a set of n-1 edges of minimum total weight which form a spanning tree of the… 
Highly Cited
1983
Highly Cited
1983
Efficient VLSI Networks for Parallel Processing Based on Orthogonal Trees
In this paper we describe two interconnection networks for parallel processing, namely the orthogonal trees network and the… 
Highly Cited
1974
Highly Cited
1974
Improvements of the Held—Karp algorithm for the symmetric traveling-salesman problem
A highly efficient algorithm (HK) devised by Held and Karp for solving the symmetric traveling-salesman problem was presented at… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)