The Diameter and Maximum Link of the Minimum Routing Cost Spanning Tree Problem
The minimum routing cost spanning tree (MRCST) is a spanning tree that minimizes the sum of pairwise distances between its vertices given a weighted graph. In this study, we use Campos Algorithm with slight modifications on the coefficient of spanning potential. Those algorithms were implemented on...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Magister Program of Material Sciences, Graduate School of Universitas Sriwijaya
2022-10-01
|
| Series: | Science and Technology Indonesia |
| Subjects: | |
| Online Access: | https://sciencetechindonesia.com/index.php/jsti/article/view/583/271 |