Generating colored trees

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3787 LNCS, Issue , 2005, Pages 249-260

  Nakano, Shin Ichi ^a   Uno, Takeaki ^b  

^a GUNMA UNIVERSITY   (Japan)

^b NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL GEOMETRY; GRAPH THEORY;

A C-TREE; CONSTANT TIME;

TREES (MATHEMATICS);

EID: 33744912264     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11604686_22     Document Type: Conference Paper

References (17)

1. [A95] A. V. Aho and J. D. Ullman, Foundations of Computer Science, Computer Science Press, New York, (1995).
2. [A03] T. Asai, H. Arimura, T. Uno, and S. Nakano, Discovering Frequent Substructures in Large Unordered Trees, The 6th International Conference on Discovery Science (DS'03) LNAI 2843, (2003), pp.47-61.
3. [B80] T. Beyer and S. M. Hedetniemi, Constant Time Generation of Rooted Trees, SIAM J. Comput., 9, (1980), pp.706-712.
4. [C05] Y. Chi, S. Nijsseny, R. R. Muntz and J. N. Kok, Frequent Subtree Mining - An Overview, Fundamenta Informaticae, Special Issue on Graph and Tree Mining, 2005. (to appear)
5. [G93] L. A. Goldberg, Efficient Algorithms for Listing Combinatorial Structures, Cambridge University Press, New York, (1993).
6. [KS98] D. L. Kreher and D. R. Stinson, Combinatorial Algorithms, CRC Press, Boca Raton, (1998).
7. [LN01] Z. Li and S. Nakano, Efficient Generation of Plane Triangulations without Repetitions, Proc. ICALP2001, LNCS 2076, (2001), pp.433-443.
8. [LR99] G. Li and F. Ruskey, The Advantage of Forward Thinking in Generating Rooted and Free Trees, Proc. 10th Annual ACM-SIAM Symp. on Discrete Algorithms, (1999), pp.939-940.
9. [M98] B. D. McKay, Isomorph-free Exhaustive Generation, J. of Algorithms, 26, (1998), pp.306-324.
10. [N02] S. Nakano, Efficient Generation of Plane Trees, Information Processing Letters, 84, (2002), pp.167-172.
11. [NU03] S. Nakano and T. Uno, Efficient Generation of Rooted Trees, Nil Technical Report (NII-2003-005E) (2003). (http://research.nii.ac.jp/TechReports/03-005E.html)
12. [NU04] S. Nakano and T. Uno, Constant Time Generation of Trees with Specified Diameter, Proc. WG2004, LNCS, 3353, (2004), pp.33-45.
13. [RS00] F. Ruskey and J. Sawada, A Fast Algorithm to Generate Unlabeled Necklaces, Proc. of SODA (2000), pp.256-262
14. [R78] R. C. Read, How to Avoid Isomorphism Search When Cataloguing Combinatorial Configurations, Annals of Discrete Mathematics, 2, (1978), pp.107-120.
15. [W01] D. B. West, Introduction to Graph Theory, 2nd Ed, Prentice Hall, NJ, (2001).
16. [W89] H. S. Wilf, Combinatorial Algorithms: An Update, SIAM, (1989).
17. [W86] R. A. Wright, B. Richmond, A. Odlyzko and B. D. McKay, Constant Time Generation of Free Trees, SIAM J. Comput., 15, (1986), pp.540-548.