The Spanning Tree Protocol (STP) is a network protocol that builds a loop-free logical topology for Ethernet networks. The basic function of STP is to...

graph may have several spanning trees, but a graph that is not connected will not contain a spanning tree (see about spanning forests below). If all of...

minimum spanning forest, which is a union of the minimum spanning trees for its connected components. There are many use cases for minimum spanning trees. One...

A Euclidean minimum spanning tree of a finite set of points in the Euclidean plane or higher-dimensional Euclidean space connects the points by a system...

Look up spanning tree in Wiktionary, the free dictionary. Spanning tree is a term in the mathematical field of graph theory Spanning tree may also refer...

degree-constrained spanning tree is a spanning tree where the maximum vertex degree is limited to a certain constant k. The degree-constrained spanning tree problem...

In mathematics, a random minimum spanning tree may be formed by assigning independent random weights from some distribution to the edges of an undirected...

Wikimedia Commons has media related to Multiple Spanning Tree Protocol. The Multiple Spanning Tree Protocol (MSTP) and algorithm, provides both simple...

In graph theory, a minimum degree spanning tree is a subset of the edges of a connected graph that connects all the vertices together, without any cycles...

The k-minimum spanning tree problem, studied in theoretical computer science, asks for a tree of minimum cost that has exactly k vertices and forms a...

weights are computed as the difference of pixel intensities. A minimum spanning tree (MST) is a minimum-weight, cycle-free subset of a graph's edges such...

spanning tree of G is a subgraph of G containing all vertices and some of the edges, which is a tree, i.e. connected and with no cycles. A spanning tree...

weighted edge in a spanning tree. A spanning tree is a minimum bottleneck spanning tree if the graph does not contain a spanning tree with a smaller bottleneck...

minimum spanning tree (RMST) of a set of n points in the plane (or more generally, in R d {\displaystyle \mathbb {R} ^{d}} ) is a minimum spanning tree of...

A minimum-cost spanning-tree game (MCST game) is a kind of a cooperative game. In an MCST game, each player is a node in a complete graph. The graph contains...

minimum-diameter spanning tree of a finite set of points in a metric space is a spanning tree in which the diameter (the longest path length in the tree between...

A kinetic minimum spanning tree is a kinetic data structure that maintains the minimum spanning tree (MST) of a graph whose edge weights are changing as...

The distributed minimum spanning tree (MST) problem involves the construction of a minimum spanning tree by a distributed algorithm, in a network where...

good spanning tree T {\displaystyle T} of an embedded planar graph G {\displaystyle G} is a rooted spanning tree of G {\displaystyle G} whose non-tree edges...

the (non-negative) shortest path problem and the minimum spanning tree problem. If a Steiner tree problem in graphs contains exactly two terminals, it reduces...

Capacitated minimum spanning tree is a minimal cost spanning tree of a graph that has a designated root node r {\displaystyle r} and satisfies the capacity...

count spanning trees in an undirected graph, which is addressed by the matrix tree theorem. (Cayley's formula is the special case of spanning trees in a...

theory, a Trémaux tree of an undirected graph G {\displaystyle G} is a type of spanning tree, generalizing depth-first search trees. They are defined...

the edges of which is lowest among all spanning trees of G {\displaystyle G} , is called a minimum spanning tree (MST). It is not necessarily unique. More...

algorithm can only be applied to unweighted graphs. A minimum spanning tree is a tree-like subgraph of a given graph G, in which it keeps all the nodes...

Linear spanning, a concept in abstract algebra Spanning tree, a subgraph which is a tree, containing all the vertices of a graph Søren Spanning (1951–2020)...

random tree is a tree or arborescence that is formed by a stochastic process. Types of random trees include: Uniform spanning tree, a spanning tree of a...

In graph theory, a connected dominating set and a maximum leaf spanning tree are two closely related structures defined on an undirected graph. A connected...

A kinetic Euclidean minimum spanning tree is a kinetic data structure that maintains the Euclidean minimum spanning tree (EMST) of a set P of n points...

path weight in the minimum spanning tree of the metric. From the minimum spanning tree, one can construct a Cartesian tree, the root node of which represents...