Solving the Shortest Total Path Length Spanning Tree Problem Using the Modified Sollin and Modified Dijkstra Algorithms
In a weighted connected graph, the shortest total path length spanning tree problem is a problem when we need to discover the spanning tree with the lowest total cost of all pairwise distances between its vertices. This problem is also known as the minimum routing cost spanning tree (MRCST). In this...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Magister Program of Material Sciences, Graduate School of Universitas Sriwijaya
2023-10-01
|
| Series: | Science and Technology Indonesia |
| Subjects: | |
| Online Access: | https://sciencetechindonesia.com/index.php/jsti/article/view/893/367 |