Results 1 to 10 of about 227,714 (275)
This paper examines the concepts and practical applications of the spanning tree protocol (STP). It also covers per-VLAN spanning tree (PVST), multiple spanning tree (MST), and rapid STP (RSTP).
Dana Faiq Abd+3 more
doaj +2 more sources
Some models for inverse minimum spanning tree problem with uncertain edge weights [PDF]
The inverse minimum spanning tree (IMST) problem is an inverse optimization problem in which one makes the least modification to the edge weights of a predetermined spanning tree, to make it the minimum spanning tree with respect to new edge weights ...
Sagarika Biswal, Ganesh Ghorai
doaj +1 more source
The Implementation of Kruskal’s Algorithm for Minimum Spanning Tree in a Graph [PDF]
Kruskal’s Algorithm is an algorithm used to find the minimum spanning tree in graphical connectivity that provides the option to continue processing the least-weighted margins.
Paryati, Salahddine Krit
doaj +3 more sources
NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
In this paper, we study undirected multiple graphs of any natural multiplicity k > 1. There are edges of three types: ordinary edges, multiple edges and multi-edges. Each edge of the last two types is a union of k linked edges, which connect 2 or (k +
Alexander Valeryevich Smirnov
doaj +1 more source
Successive minimum spanning trees [PDF]
AbstractIn a complete graphwith independent uniform(or exponential) edge weights, letbe the minimum‐weight spanning tree (MST), andthe MST after deleting the edges of all previous trees. We show that each tree's weightconverges in probability to a constant, with, and we conjecture that.
Janson, Svante, Sorkin, Gregory B.
openaire +8 more sources
Comparative Study of SWST (Simple Weighted Spanning Tree) and EAST (Energy Aware Spanning Tree) [PDF]
Wireless Sensors Networks (WSNs) are utilized in many diverse applications ranging from security, environmental monitoring, landslide detection, patient monitoring, reconnaissance operations, structural health monitoring and smart buildings.
Lifford McLauchlan+2 more
doaj +1 more source
Transversal factors and spanning trees [PDF]
Since the proof of a "colorful" version of [Caratheodory's theorem](https://en.wikipedia.org/wiki/Carath%C3%A9odory%27s_theorem_%28convex_hull%29) by Bárány in 1982, it has been an important problem to obtain colorful extensions of other classical results in discrete geometry (for instance Tverberg's theorem).
Montgomery, Richard+2 more
openaire +2 more sources
Spanning k-Ended Tree in 2-Connected Graph
Win proved a very famous conclusion that states the graph G with connectivity κ(G), independence number α(G) and α(G)≤κ(G)+k−1(k≥2) contains a spanning k-ended tree. This means that there exists a spanning tree with at most k leaves.
Wanpeng Lei, Jun Yin
doaj +1 more source
Penelitian ini membahas tentang penyelesaian masalah transportasi dengan pendekatan Minimum Spanning Tree (MST) menggunakan algoritma Kruskal dan algoritma Prim untuk mencari solusi optimal.
Yusufiani Nurlinawati Dili+2 more
doaj +1 more source
Chain-Constrained Spanning Trees [PDF]
We consider the problem of finding a spanning tree satisfying a family of additional constraints. Several settings have been considered previously, the most famous being the problem of finding a spanning tree with degree constraints. Since the problem is hard, the goal is typically to find a spanning tree that violates the constraints as little as ...
Rico Zenklusen, Neil Olver, Neil Olver
openaire +7 more sources