spanning tree


Also found in: Wikipedia.

spanning tree

[′span·iŋ ‚trē]
(mathematics)
A spanning tree of a graph G is a subgraph of G which is a tree and which includes all the vertices in G.
References in periodicals archive ?
The spanning tree has looked like a spider's web for a good 18 months.
Sensoy & Benjamin (2014) studied the correlations and stabilities of Asia-pacific stock markets by using the dynamical spanning tree methods to analyze the stock index weekly return data between 1992 and 2013 from 11 Asia-pacific countries including Japan, India, Hongkong, China Mainland, Taiwan, Thailand, Malaysia, Indonesia, Philippe, Australia, Korea and Singpore.
Spanning Tree Results for Graphs and Multigraphs: A Matrix-Theoretic Approach
Stability-DG trees and compare to that of the minimum-distance spanning tree based data gathering trees with respect to metrics such as tree lifetime, delay per round, node lifetime, network lifetime and coverage loss time, under both sufficient-energy and energyconstrained scenarios.
To alleviate the I/O bottleneck in virtual MapReduce cluster, we construct a minimum-weight spanning tree to group the nodes with their communication conditions and data locality.
A spanning tree is an acyclic subgraph of a graph G, which contains all vertices from G.
The algorithm also makes use of a self stabilizing spanning tree imposed over the network topology to handle the challenges posed by the dynamic nature of the system.
Clustering algorithms using minimal spanning tree takes the advantage of MST.
7c(C") = n - eT(G) where eT(G) is the maximum number of pendant vertices in any spanning tree TG of G.
is a (simplicial) spanning tree of [DELTA] if the following three conditions hold:
1w rapid spanning tree; per VLAN spanning tree (PVST); and secure shell (SSH).
The switch also has Rapid spanning tree, link aggregation, VRRP and jumbo frame support.