Application of Extension Analytic Hierarchy Process in Spanning Tree

Keywords

Minimum spanning tree, Spanning tree, Euclidean minimum spanning tree, Kruskal's algorithm, Connected dominating set

References

• On the shortest spanning subtree of a graph and the traveling salesman problemJoseph B. Kruskal — 1956
• Shortest connection networks and some generalizationsR. C. Prim — 1957
• Programming, Games and Transportation NetworksK. B. Haley — 1966

Cited by

• A Crossover Algebra for Solving Minimum Spanning Tree in Network Design with Diameter ConstraintsZiyi Wang, Kai Shi, Fuqiang Qiao — 2021
• Primitive Knowledge Graph Construction Base on Eventelement DrivenNana Wang, Zhuoyun Guan, Yu Guo — 2021
• Application of Fuzzy Extension Analytic Hierarchy Process in Location Selection of Logistics CenterHe Yu, Nana Wang, Jiaqi Pan — 2021

Related papers

• Pendekatan Matriks Ketetanggaan Berbobot untuk Solusi Minimum Spanning Tree (MST)Tri Yani Akhirina, Thomas Afrizal — 2020
• Construction of Minimum Cost Spanning Tree on Kruskal AlgorithmKun Huang — 2010
• On the complexity of bicriteria spanning tree problems for a set of points in the planeD. T. Lee, Dae Young Seo — 1999
• DESIGN AND IMPLEMENTATION OF KRUSKAL'S MINIMUM SPANNING TREE ALGORITHM IN C++Nadia Moqbel Hassan Al-Zubaydi — 2020
• Design and Analysis of Minimum Spanning Tree in Euclidean PlaneGe Hong-mei, Xu Chao, Bencheng Yu — 2013
• Incremental minimum spanning tree algorithmsLaura Ciupală, Adrian Marius Deaconu, Delia Spridon — 2020
• PENERAPAN TEORI GRAF UNTUK MENYELESAIKAN MASALAH MINIMUM SPANNING TREE (MST) MENGGUNAKAN ALGORITMA KRUSKALSwaditya Rizki — 2012