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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
The minimum spanning tree clustering algorithm is known to be capable of detecting clusters with irregular boundaries. In this… (More)
  • table 1
  • figure 1
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This paper presents a clustering algorithm for partitioning a minimum spanning tree with a constraint on minimum group size. The… (More)
  • figure 1
  • figure 2
  • table 1
  • table 4
  • table 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
Weestablishthatthealgorithmiccomplexity of theminimumspanningtreeproblemisequal to its decision-treecomplexity. Specifically… (More)
  • figure 1
Is this relevant?
Highly Cited
2000
Highly Cited
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is <italic>0… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1999
1999
MST is fundamental problem with diverse applications. ■ Designing physical networks. – telephone, electrical, hydraulic, TV cable… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
The problem considered here is that of determining whether a given spanning tree is a minimal spanning tree. In 1984 Komlós… (More)
Is this relevant?
Highly Cited
1985
Highly Cited
1985
It is standard practice among authors discussing the minimum spanning tree problem to refer to the work of Kruskal(1956) and Prim… (More)
Is this relevant?
Highly Cited
1980
Highly Cited
1980
In this paper the problem of a degree-constrained minimum spanning tree (DCMST) is defined. The problem is formulated as a linear… (More)
  • table 1
  • table 2
  • figure 1
  • table 3
  • table 4
Is this relevant?
Highly Cited
1976
Highly Cited
1976
This paper gives a method for finding a minimum spanning tree in an undirected graph. If the problem graph has n vertices and e… (More)
  • figure 1
Is this relevant?
Highly Cited
1969
Highly Cited
1969
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • table 2
Is this relevant?