Advertisement

Ranking trees generated by rotations

  • Samuel W. Bent
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 447)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

6. References

  1. 1.
    Gary D. Knott, “A numbering system for binary trees.” CACM 20 (1977), 113–115.Google Scholar
  2. 2.
    Joan M. Lucas, “The rotation graph of binary trees is Hamiltonian.” J. Algorithms 8 (1987), 503–535.CrossRefGoogle Scholar
  3. 3.
    Gopal Mohanty, Lattice Path Counting and Applications. Academic Press, 1979.Google Scholar
  4. 4.
    Andrzej Proskurowski, “On the generation of binary trees.” JACM 27 (1980), 1–2.CrossRefGoogle Scholar
  5. 5.
    Andrzej Proskurowski and Frank Ruskey, “Binary tree gray codes.” J. Algorithms 6 (1985), 225–238.CrossRefGoogle Scholar
  6. 6.
    Andrzej Proskurowski and Frank Ruskey, “Generating binary trees by transpositions.” Proceedings of the First Scandanavian Workshop on Algorithm Theory, published as Lecture Notes in Computer Science 318, 199–207. Springer-Verlag, 1988.Google Scholar
  7. 7.
    Doron Rotem and Y. L. Varol, “Generation of binary trees from ballot sequences.” JACM 25 (1978), 396–404.Google Scholar
  8. 8.
    Daniel D. Sleator, Robert E. Tarjan, and William P. Thurston, “Rotation distance, triangulations, and hyperbolic geometry.” J. American Mathematical Society 1 (1988), 647–681.Google Scholar
  9. 9.
    David Zerling, “Generating binary trees using rotations.” JACM 32 (1985), 694–701.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1990

Authors and Affiliations

  • Samuel W. Bent
    • 1
  1. 1.Department of Mathematics and Computer ScienceDartmouth CollegeHanover

Personalised recommendations