- Aho , A. V , Hopcropt , J. E. and Ullman , J. D. 1974 . The design and analysis of computer algorithms , Reading, MA : Addison Wesley .
- Barr , R. S. , Helgaon , R. V and Kennington , J. L. 1989 . Minimal spanning tree: An empirical investigation of parallel algorithm . Parallel Computing , 2 : 45 – 52 .
- Kumar , V. , Gram , A. , Gupta , A. and Karypis , G. 1994 . Introduction to parallel computing , CA : Benjamin/Cummings Publishing Company .
- Qunin , M. J. 1994 . Parallel computing , NY : McGraw Hill, Inc. .
- Reghbate , E. and Comeil , D. G. 1978 . Parallel computation in graph theory . SIAM Journal on Computing , 2 (2} ) : 230 – 237 .
- Salehi-Fathabadi , H. and Ahrabian , H. 1995 . A new algorithm for minimum spanning tree using Depth-Fust search in an undirected graph . Intern. J. Computer Math. , 7 : 157 – 161 .
- Yoo , Y. B. 1983 . “ Parallel processing for some network optimization problem ” . Pullman, WA : Computer Science Dept., Washington State University . Ph.D. dissertation
Parallel Algorithms for Minimum Spanning Tree Problem
Reprints and Corporate Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Academic Permissions
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
Related research
People also read lists articles that other readers of this article have read.
Recommended articles lists articles that we recommend and is powered by our AI driven recommendation engine.
Cited by lists all citing articles based on Crossref citations.
Articles with the Crossref icon will open in a new tab.