Computational Methods for Minimum Spanning Tree Algorithms-Reference-Cited by-同舟云学术

Computational Methods for Minimum Spanning Tree Algorithms

Published:1984-03 Issue:1 Volume:5 Page:157-174
ISSN:0196-5204
Container-title:SIAM Journal on Scientific and Statistical Computing
language:en
Short-container-title:SIAM J. Sci. and Stat. Comput.

Author:

Haymond R. E.,Jarvis J. P.,Shier D. R.

Publisher

Society for Industrial & Applied Mathematics (SIAM)

Link

http://epubs.siam.org/doi/pdf/10.1137/0905012

Reference38 articles.

1. Fast Algorithms for Constructing Minimal Spanning Trees in Coordinate Spaces

2. Claude Berge, A. Ghouila-Houri, Programming, games and transportation networks, Translated from the French by Maxine Merrington and C. Ramanujacharyulu, Methuen and Co., Ltd., London, 1965, 179–18033:7114

3. Vinod Chachra, Prabhakar M. Ghare, James M. Moore, Applications of graph theory algorithms, North-Holland, New York, 1979, 67–7380f:900010443.90052

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Finding MST by Considering Increasing Cost Order of the Edges Incident on Vertices;Lecture Notes in Networks and Systems;2021

2. An Efficient Greedy Minimum Spanning Tree Algorithm Based on Vertex Associative Cycle Detection Method;Procedia Computer Science;2016

3. Minimum-weight spanning tree algorithms A survey and empirical study;Computers & Operations Research;2001-07

4. Descriptive statistics of large data sets by scatter plots, an exploratory approach;Statistica Neerlandica;1992-12

5. An in-depth empirical investigation of non-greedy approaches for the minimum spanning tree problem;European Journal of Operational Research;1992-02