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...
| Hlavní autor: | |
|---|---|
| Médium: | Článek |
| Jazyk: | English |
| Vydáno: |
Elsevier
2024-03-01
|
| Edice: | Results in Control and Optimization |
| Témata: | |
| On-line přístup: | http://www.sciencedirect.com/science/article/pii/S2666720723001613 |