On the diameter of the rotation graph of binary coupling trees

Discrete Mathematics

Volumn 245, Issue 1-3, 2002, Pages 1-18

  Pack, V ^a   Lievens, S ^a   Van Der Jeugt, J ^a  

^a GHENT UNIVERSITY   (Belgium)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33750742331     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/s0012-365x(01)00418-6     Document Type: Article

References (20)

1. B. Bollobâs, Extremal graph theory, London Mathematical Society Monographs, Vol. 11, Academic Press, New York, 1978.
2. F. Buckley, F. Harary, Distance in Graphs, Addison-Wesley, Reading, MA, 1990.
3. K. Culik II, D. Wood, A note on some tree similarity measures, Inform. Process. Lett. 15 (1982) 39-42.
4. W.H. Day, Properties of the nearest neighbor interchange metric for trees of small size, J. Theor. Biol. 101 (1983) 275-288.
5. V. Fack, S. Lievens, J. Van der Jeugt, On rotation distance between binary coupling trees and applications for 3n/-coefficients, Comput. Phys. Commun. 119 (1999) 99-114.
6. V. Fack, S.N. Pitre, J. Van der Jeugt, New efficient programs to calculate general recoupling coefficients. Part I: Generation of a summation formula, Comput. Phys. Commun. 83 (1994) 275-292.
7. R.L. Graham, D.E. Knuth, O. Patashnik, Concrete Mathematics, a Foundation for Computer Science, Addison-Wesley, Reading, MA, 1995.
8. J. Jarvis, J. Luedeman, D. Shier, Comments on computing the similarity of binary trees, J. Theor. Biol. 100 (1983) 427-433.
9. D.E. Knuth, Sorting and Searching, The Art of Computer Programming, Vol. 3, Addison-Wesley, Reading, MA, 1973.
10. D.E. Knuth, Fundamental Algorithms, The Art of Computer Programming, Vol. l, Addison-Wesley, Reading, MA, 1997.
11. M. Li, J. Tromp, L. Zhang, On the nearest neighbor interchange distance between evolutionary trees, J. Theor. Biol. 182 (1996) 463-467.
12. F. Luccio, L. Pagli, On the upper bound on the rotation distance of binary trees, Inform. Process. Lett. 31 (1989) 57-60.
13. E. Mäkinen, On the rotation distance of binary trees, Inform. Process. Lett. 26 (1987) 271-272.
14. B. McKay, nauty. http://cs.anu.edu.au/people/bdm/nautyJ.
15. D. Robinson, Comparison of labeled trees with valency three, J. Combin. Theory 11 (1971) 105-119.
16. R.O. Rogers, R.D. Dutton, On distance in the rotation graph of binary trees, Congr. Numer. 120 (1996) 103-113.
17. D.D. Sleator, R.E. Tarjan, W.P. Thurston, Short encodings of evolving structures, SIAM J. Disc. Math. 5 (1982) 428-450.
18. D.D. Sleator, R.E. Tarjan, W.P. Thurston, Rotation distance, triangulations and hyperbolic geometry, J. Amer. Math. Soc. 1 (1988) 647-681.
19. N.J. Sloane, On-line encyclopedia of integer sequences, http://www.research.att.com/ njas/sequences/index.html.
20. M.S. Waterman, T.F. Smith, On the similarity of dendrograms, J. Theor. Biol. 73 (1978) 789-800.