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.
2009
2009
Research on minimum spanning tree based on prim algorithm
In the minimum spanning tree algorithm of graph, Prim and Kruskal algorithm are respectively applied to dense graph and sparse… 
2009
2009
A New Parallel Algorithm for Minimum Spanning Tree Problem
Minimum Spanning Tree (MST) is one of the well known classical graph problems. It has many applications in VLSI layout and… 
2008
2008
Improving NSGA-II Algorithm Based on Minimum Spanning Tree
Diversity maintenance is an importance part of multi-objective evolutionary algorithm. In this paper, a new variant for the NSGA… 
Review
2007
Review
2007
Weight-Constrained Minimum Spanning Tree Problem
In an undirected graph G we associate costs and weights to each edge. The weight-constrained minimum spanning tree problem is to… 
2005
2005
Minimum Spanning Trees in Hierarchical Multiclass Support Vector Machines Generation
Support Vector Machines constitute a powerful Machine Learning technique originally designed for the solution of 2-class problems… 
2000
2000
Interconnections, second edition: bridges, routers, switches, and internetworking protocols [Bookshelf]
he global network we refer to as the Internet is perhaps one of the most influential technologies since the invention of the… 
1996
1996
A minimum spanning tree approach to line image analysis
We propose a graph theoretic approach for extracting the skeleton of a binary line image. Unlike other thinning methods, emphasis… 
1992
1992
Minimum weight spanning trees with bounded diameter
MINIMUM WEIGHT SPANNING TREES WITH BOUNDED DIAMETER N.R. Achuthan and L. Caccetta School of Mathematics and Statistics Curtin… 
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… 
1980
1980
Second-Order Greedy Algorithms for Centralized Teleprocessing Network Design
We consider the problem of designing a centralized telecommunication network comprised of multipoint lines given a set of…