Open AccessApplication of Extension Analytic Hierarchy Process in Spanning Tree
Author(s) -
Nana Wang,
Wei Liu
Publication year - 2020
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1624/3/032031
Subject(s) - minimum spanning tree , spanning tree , euclidean minimum spanning tree , kruskal's algorithm , connected dominating set , reverse delete algorithm , distributed minimum spanning tree , mathematics , graph , extension (predicate logic) , shortest path tree , hierarchy , tree (set theory) , minimum degree spanning tree , sorting , computer science , combinatorics , algorithm , economics , market economy , programming language
In view of the problem how to choose the minimum spanning tree.firstly, a minimum spanning tree was found by using broken circle. Secondly connected graph was reduced to obtain a reduced graph. Using broken circle method get all the minimum spanning tree, finally, it uses the extension analytic hierarchy process (EAHP), build the hierarchy, for all of the minimum spanning tree of outlier, aggregation coefficient, average path length, network sorting efficiency, optimal spanning tree, extension analytic hierarchy process provides the theoretical foundation for the screening of minimum spanning tree.