Spanning tree

Known as: Fundamental cutset, Fundamental cycle, Spanning forest 
In the mathematical field of graph theory, a spanning tree T of an undirected graph G is a subgraph that is a tree which includes all of the vertices… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1967-2017
020040019672017

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
We formalize weighted dependency parsing as searching for maximum spanning trees (MSTs) in directed graphs. Using this… (More)
  • figure 1
  • figure 2
  • table 1
  • table 2
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
2004
Highly Cited
2004
Simplicity, cost effectiveness, scalability, and the economies of scale make Ethernet a popular choice for local area networks… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2003
Highly Cited
2003
The fundamental design choices in an evolutionary algorithm are its representation of candidate solutions and the operators that… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We establish that the algorithmic complexity of the minimumspanning tree problem is equal to its decision-tree complexity… (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?
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
1983
Highly Cited
1983
A distributed algorithm is presented that constructs the minimum-weight spanning tree in a connected undirected graph with… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
Highly Cited
1974
Highly Cited
1974
Given a set of nodes N (i 1, 2, ..., n) which may represent cities and a set of requirements ria which may represent the number… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?