Search for "Spanning tree" in article titles:

1. Spanning tree: 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 of G. In general, a graph may have several spanning trees ... (Tree which includes all vertices of a graph) [100%] 2022-08-19 [Spanning tree] [Axiom of choice]...
2. Good spanning tree: In the mathematical field of graph theory, a good spanning tree \displaystyle{ T }[/math] of an embedded planar graph \displaystyle{ G }[/math] is a rooted spanning tree of \displaystyle{ G }[/math] whose non-tree edges satisfy the following conditions. Let ... [81%] 2023-12-19 [Computational problems in graph theory] [Spanning tree]...
3. Spanning Tree Protocol: 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 prevent bridge loops and the broadcast radiation that results from them. (Network protocol that builds a loop-free logical topology for Ethernet networks) [81%] 2022-11-29 [Network protocols] [Link protocols]...
4. Spanning Tree Protocol: Le Spanning Tree Protocol (aussi appelé STP) est un protocole réseau de niveau 2 permettant de déterminer une topologie réseau sans boucle (appelée algorithme de l'arbre recouvrant) dans les LAN avec ponts. Il est défini dans la norme IEEE 802 ... [81%] 2024-05-24
5. Spanning Tree Protocol: 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 prevent bridge loops and the broadcast radiation that results from them. (Network protocol that builds a loop-free logical topology for Ethernet networks) [81%] 2024-12-12 [Network protocols] [Link protocols]...
6. Spanning Tree Protocol: En redes computacionales, el Spanning Tree Protocol (STP; en español: Protocolo de Árbol de Expansión)​ es un protocolo de red de capa 2 en el modelo OSI (capa de enlace de datos), que crea una topología lógica sin bucles para ... [81%] 2024-11-25
7. Capacitated minimum spanning tree: Capacitated minimum spanning tree is a minimal cost spanning tree of a graph that has a designated root node \displaystyle{ r }[/math] and satisfies the capacity constraint \displaystyle{ c }[/math]. The capacity constraint ensures that all subtrees (maximal subgraphs connected ... (Spanning tree type) [70%] 2023-03-18 [Spanning tree]
8. Distributed minimum spanning tree: The distributed minimum spanning tree (MST) problem involves the construction of a minimum spanning tree by a distributed algorithm, in a network where nodes communicate by message passing. It is radically different from the classical sequential problem, although the most ... [70%] 2024-01-03 [Spanning tree] [Distributed algorithms]...
9. Kinetic minimum spanning tree: 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 a continuous function of time. The most efficient known data structure for the general ... (Kinetic data structure) [70%] 2023-05-20 [Kinetic data structures] [Spanning tree]...
10. Distributed minimum spanning tree: The distributed minimum spanning tree (MST) problem involves the construction of a minimum spanning tree by a distributed algorithm, in a network where nodes communicate by message passing. It is radically different from the classical sequential problem, although the most ... [70%] 2023-08-27 [Spanning tree] [Distributed algorithms]...
11. K-minimum spanning tree: 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 subgraph of a larger graph. It is also called the k-MST or edge ... [70%] 2023-03-18 [Spanning tree]
12. Multiple Spanning Tree Protocol: The Multiple Spanning Tree Protocol (MSTP) and algorithm, provides both simple and full connectivity assigned to any given Virtual LAN (VLAN) throughout a Bridged Local Area Network. MSTP uses BPDUs to exchange information between spanning-tree compatible devices, to prevent ... [70%] 2021-12-21 [Network protocols] [Link protocols]...
13. Degree-constrained spanning tree: In graph theory, a 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 is to determine whether a particular graph has such a ... [70%] 2022-07-14 [Spanning tree] [NP-complete problems]...
14. Minimum degree spanning tree: In graph theory, for a connected graph \displaystyle{ G }[/math], a spanning tree \displaystyle{ T }[/math] is a subgraph of \displaystyle{ G }[/math] with the least number of edges that still spans \displaystyle{ G }[/math]. A number of properties can ... [70%] 2022-08-04 [Spanning tree]
15. Euclidean minimum spanning tree: 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 of line segments with the points as endpoints, minimizing the total length of the ... (Shortest network connecting points) [70%] 2023-08-29 [Spanning tree] [Geometric graphs]...
16. Capacitated minimum spanning tree: 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 constraint c {\displaystyle c} . The capacity constraint ensures that all subtrees (maximal subgraphs connected ... (Spanning tree type) [70%] 2023-05-21 [Spanning tree]
17. Minimum bottleneck spanning tree: In mathematics, a minimum bottleneck spanning tree (MBST) in an undirected graph is a spanning tree in which the most expensive edge is as cheap as possible. A bottleneck edge is the highest weighted edge in a spanning tree. [70%] 2022-11-12 [Graph algorithms] [Spanning tree]...
18. Minimum bottleneck spanning tree: In mathematics, a minimum bottleneck spanning tree (MBST) in an undirected graph is a spanning tree in which the most expensive edge is as cheap as possible. A bottleneck edge is the highest weighted edge in a spanning tree. [70%] 2024-09-22 [Graph algorithms] [Spanning tree]...
19. Minimum spanning tree-based segmentation: Image segmentation strives to partition a digital image into regions of pixels with similar properties, e.g. homogeneity. [63%] 2022-08-21 [Spanning tree] [Image segmentation]...
20. Minimum-cost spanning tree game: 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. [63%] 2024-06-16 [Cooperative games] [Spanning tree]...
21. Minimum routing cost spanning tree: In computer science, the minimum routing cost spanning tree of a weighted graph is a spanning tree minimizing the sum of pairwise distances between vertices in the tree. It is also called the optimum distance spanning tree, shortest total path ... [63%] 2024-06-24 [Spanning tree] [NP-complete problems]...