Restoring Survivable Spanning Tree: An Alternative Algorithm

2021 ◽  
pp. 1-11
Author(s):  
Lulu Zheng ◽  
Yalan Wu ◽  
Jiale Huang ◽  
Peng Liu ◽  
Jigang Wu
Keyword(s):  
Spanning Tree ◽  
Alternative Algorithm

scholarly journals ALGORITMA “HANCURKAN SEMUA SIKEL” UNTUK MENENTUKAN POHON PERENTANG MINIMUM DARI SUATU GRAF BERBOBOT

2019 ◽  
Vol 21 (2) ◽  
pp. 91-98
Author(s):  
Ricky Aditya
Keyword(s):  
Graph Theory ◽  
Spanning Tree ◽  
Minimum Spanning Tree ◽  
Weighted Graph ◽  
Alternative Algorithm

The minimum spanning tree is one of the applications of graph theory in various fields. There are several algorithms for determining the minimum spanning tree of a weighted graph, such as Kruskal's algorithm and Prim's algorithm. These two algorithms are not really easy to teach to students in general. Therefore in this paper presented an alternative algorithm called the algorithm "Destroy All Sikel", which is more intuitive and easier to understand. Furthermore, there are also examples of implementation and comparison with two other algorithms.

Self-Protected Spanning Tree Based Recovery Scheme to Protect against Single Failure

2009 ◽  
Vol E92-B (3) ◽  
pp. 909-921
Author(s):  
Depeng JIN ◽  
Wentao CHEN ◽  
Li SU ◽  
Yong LI ◽  
Lieguang ZENG
Keyword(s):  
Spanning Tree ◽  
Recovery Scheme
Sign in / Sign up

Export Citation Format

Share Document