1. P. M. Camerini, G. Galbiati and F. Maffioli,Algorithms for finding optimum trees: Description, use and evaluation, Ann. Oper. Res., 13 (1988), 265–397.
2. N. Deo,Graph theory with Applications to Engineering and computer Science, Prentice Hall of India Private Limited, New Delhi, 1990.
3. M. L. Fredman and R. E. Tarjan,Fibonacci heaps and their uses in network optimization algorithms in Proc. 25-th Ann IEEE symp. on FOCS, (1984), 338–346.
4. H. P. Gabow, Z. Galil, T. Spencer and R. E. Tarjan,Efficient algorithms for finding minimum spanning trees in undirected and directed graphs, Combinatorica, 6 (1986), 109–122.
5. G. R. Gould,Graph Theory, Benjamin/Cummings, Menio Park, CA, 1988.