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.
McGraw-Hill Dictionary of Scientific & Technical Terms, 6E, Copyright © 2003 by The McGraw-Hill Companies, Inc.
References in periodicals archive ?
The performance of the algorithm depends on the sum of these approximation ratios, a property of the spanning tree called the tree condition number
Observe that a loop in a connected graph can be characterized as an edge that is in no spanning tree, while a bridge is an edge that is in every spanning tree.
unnecessary network layers and removing legacy protocols such as spanning tree
New Netvisor capabilities include enhanced vflow programmability with C' and Java APIs, Active-Active Virtual Link Aggregation Groups, Rapid Spanning Tree Protocol, and the Virtual Router Redundancy Protocol.
Some of the available tree based architecture in wireless sensor networks are: clustered tree network [1], Minimum Steiner tree [2], Minimum spanning tree, Minimum-hot-spot query trees [3], Query routing tree [4].
Under this deployment at Yahoo Japan, Brocade VDX Ethernet Fabric modular and fixed-port network switches replaced a legacy Spanning Tree Protocol-based network.
Spanning Tree Protocol (STP) and Storm Control features help control planned or inadvertent cable loops, so administrators can confidently build a mesh of switches and quickly expand their network to support the organizations growing workforce.
Unfortunately, the algorithm is centralized and based on constructing a spanning tree, which makes it very costly in terms of communication overhead to maintain the CDS in the case of mobility and topology changes.
The problem of finding the Pareto-optimal reconfigurations in distribution networks considering several objective functions is quite similar to the multiobjective minimum spanning tree (MO-MST) problem.