References
- Ann. Oper. Res. v.13 Algorithms for finding optimum trees: Description, use and evaluation P. M. Camerini;G. Galbiati;F. Maffioli
- Prentice Hall of India Private Limited Graph Theroy with Applications to Engineering and computer Science N. Deo
- Proc. 25-th An IEEE symp. on FOCS Fibonacci heaps and their uses in network optimization algorithms M. L. Fredman;R. E. Tarjan
- Combinatorica v.6 Efficient algorithms for finding minimum spanning trees in undirected and directed graphs H. P. Gabow;Z. Galil;T. Spencerl;R. E. Tarjan
- Benjamin / Cummings, Menio Park. CA Graph Therory G R. Gould
- Intern. J. Computer Math v.70 An efficient algorithm to generate all maximal independent sets on trapezoid grphs M. Hota;M. Pal;T. K. Pal
- Information Processing Letters v.34 A parallel algorithm for eliminating cycles in undirected graphs P. Klein;C. Stein
- IEEE Trans. Computer. v.34 The power of parallel prefix C. P. Kruskal;L. Rudolph;M. Snir
- Proc. Amer. Math. Soc. v.7 On the shortest spanning subtree of a graph and the travelling salesman problem J. B. kruskal
- Bell Systems Tech. J. v.36 Shortest connection networks and some generalizations R. C. Prim
- Information Processing Letters v.45 An O(logm) parallel algorithm for the minimum spanning tree problem F. Suraweera;P. Bhattacharya
- SIAM Data Structures and network Algorithms R. E. Tarjan
- Information Processing Letters v.53 An O(logn) parallel algorithm for constructing a spanning tree on permutation graph Y. L. Wang;H. C. Chen;C. Y. Lee
- Information Processing Letters v.4 An O(/E/ log log /V/) algorithm for finding minimum spanning tree A. Yao