Generating rooted and free plane trees

ACM Transactions on Algorithms

Volumn 2, Issue 1, 2006, Pages 1-13

  Sawada, Joe ^a  

^a UNIVERSITY OF GUELPH   (Canada)

Author keywords

CAT algorithm; Chord diagram; Free plane tree; Necklace; Planar tree; Rooted plane tree

Indexed keywords

ALGORITHMS; BOUNDARY CONDITIONS; MATHEMATICAL MODELS; THEOREM PROVING;

CAT ALGORITHM; CHORD DIAGRAM; FREE PLANE TREE; LEXICOGRAPHY; NECKLACE; NONISOMORPHIC ROOTED PLANE; PLANAR TREE; ROOTED PLANE TREE; TREE ALGORITHM;

TREES (MATHEMATICS);

EID: 33745281216     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1125994.1125995     Document Type: Article

References (15)

1. BEYER, T., AND HEDETNIEMI, S. M. 1980. Constant time generation of rooted trees. SIAM J. Comput. 9, 706-712.
2. CATTELL, K., RUSKEY, F., SAWADA, J., SERRA, M., AND MIERS, C. R. 2000. Fast algorithms to generate necklaces, unlabeled necklaces, and irreducible polynomials over gf(2). J. Alg. 37, 2, 267-282.
3. DEBRUIJN, N. G., AND MORSELT, B. 1967. A note on plane trees. J. Combinat. Theory 2, 27-34.
4. DIBATTISTA, G. D., EADES, P., TAMASSIA, R., AND TOLLIS, I. G 1998. Graph Drawing. Prentice-Hall, Englewood Cliffs, NJ.
5. HARARY, F., PRINS, G., AND TUTTE, T. W. 1964. The number of plane trees. Indag. Math. 26, 319-329.
6. JORDAN, C. 1869. Sur les assemblages des lignes. J. Reine Angew. Math. 70, 185-190.
7. LI, G. AND RUSKEY, E 1999. Advantages of forward thinking in generating rooted and free trees. In Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, S939-S940.
8. MALLOWS, C. L., AND WACHTER, K. W. 1972. Valency enumeration of rooted plane trees. J. Austral. Math. Soc. 13, 472-476.
9. NAKANO, S. 2002. Efficient generation of plane trees. Inf. Proc. Lett. 84, 167-172.
10. RUSKEY, F., AND SAWADA, J. 1999. An efficient algorithm for generating necklaces of fixed density. SIAM J. Comput. 29, 671-684.
11. SAWADA, J. 2002. A fast algorithm for generating non-isomorphic chord diagrams. SIAM J. Disc. Math. 15, 4, 546-561.
12. SCOINS, H. 1967. Placing trees in lexicographic order. Mach. Intell. 3, 43-60.
13. SLOANE, N. 2001. The on-line encyclopedia of integer sequences: A003239, A002995 (www.research.att.com/~njas/sequences/index.html).
14. WALKUP, D. W. 1972. The number of plane trees. Mathematika 19, 200-204.
15. WRIGHT, R. A., RICHMOND, B., ODLYZKO, A., AND MCKAY, B. 1986. Constant time generation of free trees. SIAM J. Comput. 15, 540-548.