ScholarLens Back to search
2013•Journal of Shihezi UniversityRequires access

A New Method for Obtaining Minimum Spanning Tree

Hong Yan-jun

Open publisher page 0 citations

Abstract

Minimum spanning tree and its algorithm is one of the important subjects in the study of graph theory.The iterative algorithm is the basic method for network optimization.For any spanning tree,if not the maximum,we can get a smaller one by iteration rule.We introduce iterative methods in terms of nontree edge and tree edge,and offer a new method to find the minimum tree from a spanning tree.The method has important application in the design of network.

About this research paper

What this paper is about

Minimum spanning tree and its algorithm is one of the important subjects in the study of graph theory.The iterative algorithm is the basic method for network optimization.For any spanning tree,if not the maximum,we can get a smaller one by iteration rule.We introduce iterative methods in terms of nontree edge and tree edge,and offer a new method to find the minimum tree from a spanning tree.The method has important application in the design of network.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Minimum spanning tree and its algorithm is one of the important subjects in the study of graph theory.The iterative algorithm is the basic method for network optimization.For any spanning tree,if not the maximum,we can get a smaller one by iteration rule.We introduce iterative methods in terms of nontree edge and tree edge,and offer a new method to find the minimum tree from a spanning tree.The method has important application in the design of network.

Key concepts: Minimum spanning tree, Spanning tree, Distributed minimum spanning tree, Euclidean minimum spanning tree, k-minimum spanning tree, Reverse-delete algorithm, Kruskal's algorithm, Prim's algorithm

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
A New Method for Obtaining Minimum Spanning Tree — Research Paper | ScholarLens