Results 41 to 50 of about 35,371 (162)
Efficient Maintenance of Minimum Spanning Trees in Dynamic Weighted Undirected Graphs
MathematicsThis paper presents an algorithm for effectively maintaining the minimum spanning tree in dynamic weighted undirected graphs. The algorithm efficiently updates the minimum spanning tree when the underlying graph structure changes.
Mao Luo +5 more
doaj +1 more source
Cross Decomposition of the Degree-Constrained Minimum Spanning Tree problem [PDF]
Journal of Systemics, Cybernetics and Informatics, 2007 As computer communication networks become a prevalent part in our daily life, the importance of efficient design of those networks becomes more evident.
Han-Suk Sohn, Dennis Bricker
doaj
Algorithms for the minimum spanning tree problem with resource allocation
Operations Research Perspectives, 2016 We formulate the minimum spanning tree problem with resource allocation (MSTRA) in two ways, as discrete and continuous optimization problems (d-MSTRA/c-MSTRA), prove these to be NP-hard, and present algorithms to solve these problems to optimality.
Seiji Kataoka, Takeo Yamada
doaj +1 more source
The Minimum Spanning Tree Problem on networks with Neutrosophic numbers [PDF]
Neutrosophic Sets and SystemsThe minimum spanning tree problem (MSTP) revolves around creating a spanning tree (ST) within a graph/network that incurs the least cost compared to all other potential STs.
Kalyan Adhikary +2 more
doaj +1 more source
Spanning Trees Minimizing Branching Costs [PDF]
Discrete Mathematics & Theoretical Computer ScienceThe Minimum Branch Vertices Spanning Tree problem aims to find a spanning tree $T$ in a given graph $G$ with the fewest branch vertices, defined as vertices with a degree three or more in $T$.
Luisa Gargano, Adele A. Rescigno
doaj +1 more source
Aksioma: Jurnal Program Studi Pendidikan Matematika, 2012 One of useful graph theory to solve the real problems is Minimum Spanning Tree (MST). MST is network optimization problems that can be applied in many fields such as transportations problems and communication network design (Gruber and Raidl, 2005).
Swaditya Rizki
doaj +1 more source
Infinity Jurnal Matematika dan Aplikasinya, 2020 Penelitian ini bertujuan untuk menentukan pohon merentang minimum (Minimum Spanning Tree) terhadap lintasan yang mengarah ke Pusat Perbelanjaan di Kota Palopo menggunakan Algoritma Semut.
Fatimah Fatimah, Marwan Sam
doaj
Solving the Minimum Spanning Tree Problem Under Interval-Valued Fermatean Neutrosophic Domain [PDF]
Neutrosophic Sets and SystemsIn classical graph theory, the minimal spanning tree (MST) is a subgraph that lacks cycles and efficiently connects every vertex by utilizing edges with the minimum weights.
Souhail Dhouib +3 more
doaj +1 more source
Minimum Diameter Spanning Tree
American Journal of Computational Mathematics, 2018 In this paper, we discuss the simple connected graphs which have a minimum diameter spanning tree such that both have same domination number.
V. T. Chandrasekaran, N. Rajasri
openaire +2 more sources
Aksioma: Jurnal Program Studi Pendidikan Matematika, 2018 This study aims to determine the minimum spanning tree of a complete graph K_n with weight constraints and completion using the cutting plane method. The cutting plane method is one of the algorithms included in the exact method.
Dewi Suhika, Wamiliana Wamiliana
doaj +1 more source