Results 41 to 50 of about 4,149 (163)

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 Systems
The 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, Prashnatita Pal, Jayanta Poray   +2 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  

OPTIMALISASI RENCANA PEMASANGAN KABEL FIBER OPTIC DI ITERA DENGAN ALGORITMA PRIM

Aksioma: Jurnal Program Studi Pendidikan Matematika, 2020
Kabel fiber optic (FO) digunakan sebagai tulang punggung jaringan komputer Institut Teknologi Sumatera (ITERA). Salah satu perencaannya adalah dengan mengukur jarak antar gedung yang akan ditarik kabel FO.
Dewi Suhika, Triyana Muliawati, Heru Ruwandar   +2 more
doaj   +1 more source

Spanning Trees Minimizing Branching Costs [PDF]

Discrete Mathematics & Theoretical Computer Science
The 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

Cluster dynamics studied with the phase-space minimum spanning tree approach [PDF]

, 2021
V. A. Kireyeu
openalex   +1 more source

PENERAPAN TEORI GRAF UNTUK MENYELESAIKAN MASALAH MINIMUM SPANNING TREE (MST) MENGGUNAKAN ALGORITMA KRUSKAL

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

Special Cases of the Minimum Spanning Tree Problem under Explorable Edge and Vertex Uncertainty [PDF]

, 2022
Corinna Mathwieser, Eranda Çela
openalex   +1 more source

Solving the Minimum Spanning Tree Problem Under Interval-Valued Fermatean Neutrosophic Domain [PDF]

Neutrosophic Sets and Systems
In 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, Vidhya K, Said Broumi, Mohamed Talea   +3 more
doaj   +1 more source

Matrix Method for Determining Minimum Spanning Tree [PDF]

, 2020
Farhan Banu
openalex   +1 more source