- Achuthan , N. R. , Caccetta , L. , Caccetta , P. and Geelen , J. F. 1994 . Computational methods for the diameter restricted minimum weight spanning tree problem . Australas. J. Cambin. , 10 : 51 – 71 .
- Ahuja , R. K. , Magnanti , T. L. and Orlin , J. B. 1993 . “Network Flaws: Theory, Algorithms, and Applications” , 79 90 Upper Saddle River, NJ : Prentice Hall .
- Bala , K. , Petropoulos , K. and Stern , T. E. 1993 . Multicasting in a Linear Lightwave Network . IEEE INFOCOM , 93 ( 3 ) : 1350 – 1358 .
- Bookstein , A. and Klein , S. T. 1991 . Compression of correlated bit-vectors . Inform. Systems , 16 (4} ) : 387 – 400 .
- Garey , M. R. and Johnson , D. S. 1979 . “Computers and Intractability: A Guide to the Theory of NPCompleteness” , 206 San Francisco : W. H. Freeman .
- Handler , G. Y. 1973 . Minimax location of a facility in an undirected tree graph . Transportation Sci , 7 : 287 – 293 .
- Horowitz , E. and Sahni , S. 1978 . “Fundamentals of Computer Algorithms” , 317 Potomac, MD : Computer Science Press .
- Kumar , V. , Deo , N. and Kumar , N. 1998 . Parallel generation of random trees and connected graphs . Congr. Numer. , 130 : 7 – 18 .
- Moret , B. M. E. and Shapiro , H. D. 1994 . An empirical analysis of algorithms for constructing a minimum spanning tree . DIMACS Series Discrete Math. Theoret Comput. Sci. , 15 : 99 – 117 .
- Raymond , K. 1989 . A tree-based algorithm for distributed mutual exclusion . ACM Trans. Comput. Systems , 7 (1} ) : 61 – 77 .
- Riordan , J. 1960 . The enumeration of trees by height and diameter . IBM J. Res. Develop. , 4 : 473 – 478 .
- Szekeres , G. 1983 . Distribution of labelled trees by diameter . Lecture Notes in Math. , 1036 : 392 – 397 .
- Wall , D. W. and Owicki , S. S. 1980 . Center-based broadcasting , Technical Report No. 189 Computer Systems Laboratory, Stanford University .
International Journal of Computer Mathematics
Volume 79, 2002 - Issue 6