Results 1 to 10 of about 79,735 (167)
UHD Journal of Science and TechnologyThis 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]
Songklanakarin Journal of Science and Technology (SJST), 2022 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]
MATEC Web of Conferences, 2021 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
Моделирование и анализ информационных систем, 2021 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
Comparative Study of SWST (Simple Weighted Spanning Tree) and EAST (Energy Aware Spanning Tree) [PDF]
International Journal of Networked and Distributed Computing (IJNDC), 2014 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
Spanning k-Ended Tree in 2-Connected Graph
Axioms, 2023 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
Approximating longest spanning tree with neighborhoods
Journal of Computational Geometry, 2023 We study the following maximization problem in the Euclidean plane: Given a collection of neighborhoods (polygonal regions) in the plane, the goal is to select a point in each neighborhood so that the longest spanning tree on selected points has maximum
Ahmad Biniaz
doaj +1 more source
Successive minimum spanning trees [PDF]
Random Structures & Algorithms, 2021 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.
Svante Janson, Gregory B. Sorkin
openaire +4 more sources
Clustered Spanning Tree - Conditions for Feasibility [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 Let H =< V, S > be a hypergraph, where V is a set of vertices and S is a set of not necessarily disjoint clusters Si ⊆ V. The Clustered Spanning Tree problem is to find a spanning tree of G which satisfies that each cluster induces a subtree, when it ...
Nili Guttmann-Beck +2 more
doaj +1 more source
Patria Artha Technological Journal, 2022 Sebagai salah satu jenis UKM dibidang kuliner, Thai Tea Azka dihadapkan dengan berbagai persoalan optimalisasi manajemen sumber daya. Dalam persoalan penugasan karyawan Thai Tea Azka mengalami kendala dalam penempatan tiap karyawan karena belum memiliki ...
Fauzan As Habi +2 more
doaj +1 more source