Mao Hu
Abstract
Minimum spanning tree problem was common in operation research for network optimization.A new minimum spanning tree algorithm of matrix was put forward. This algorithm was simple to understand and could be easily done with computer.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Minimum spanning tree problem was common in operation research for network optimization.A new minimum spanning tree algorithm of matrix was put forward. This algorithm was simple to understand and could be easily done with computer.
Key concepts: Minimum spanning tree, Spanning tree, Distributed minimum spanning tree, Kruskal's algorithm, Prim's algorithm, Reverse-delete algorithm, Euclidean minimum spanning tree, Matrix (chemical analysis)