On algorithm of producing minimum cost spanning trees by method of seeking complementary graph

Hu Zhong-bo

On algorithm of producing minimum cost spanning trees by method of seeking complementary graph

2004

Hu Zhong-bo

Presents an algorithm for finding minimum spanning trees.Compared with the traditional algorithm of Prim and Kruskal,the new algorithm has its own advantage.

Keywords:

Suurballe's algorithm
Reverse-delete algorithm
Mathematical optimization
Kruskal's algorithm
Minimum spanning tree
Prim's algorithm
Algorithm
Distributed minimum spanning tree
Mathematics
Edmonds' algorithm
Borůvka's algorithm
Expected linear time MST algorithm

Correction
Source
Cite
Save
Machine Reading By IdeaReader

References

Citations