Innovative method to solve the minimum spanning tree problem: The Dhouib-Matrix-MSTP (DM-MSTP)
The Minimum Spanning Tree problem aims to create a subset of a graph where all the vertices are connected with the minimum edge weights and with no cycle. In this field, an innovative method entitled Dhouib-Matrix-MSTP (DM-MSTP) is designed in this research work with a time complexity independently...
Main Author: | Souhail Dhouib |
---|---|
Format: | Article |
Language: | English |
Published: |
Elsevier
2024-03-01
|
Series: | Results in Control and Optimization |
Subjects: | |
Online Access: | http://www.sciencedirect.com/science/article/pii/S2666720723001613 |
Similar Items
-
Approximation theory in combinatorial optimization. Application to the generalized minimum spanning tree problem
by: Petrică C. Pop, et al.
Published: (2005-02-01) -
Approximation theory in combinatorial optimization. Application to the generalized minimum spanning tree problem
by: Petrică C. Pop, et al.
Published: (2005-02-01) -
NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
by: Alexander Valeryevich Smirnov
Published: (2021-03-01) -
The Spanning Tree of a Divisible Multiple Graph
by: Alexander V. Smirnov
Published: (2018-08-01) -
Some models for inverse minimum spanning tree problem with uncertain edge weights
by: Sagarika Biswal, et al.
Published: (2022-10-01)