Efficient generation of rooted trees

NII Technical Reports

Volumn , Issue 7, 2003, Pages

  Nakano, Shin Ichi ^a   Uno, Takeaki ^a  

^a NATIONAL INSTITUTE OF INFORMATICS   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 55449126076     PISSN: 13465597     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (3)

1. [A95] A. V. Aho and J. D. Ullman, Foundations of Computer Science, Computer Science Press, New York, (1995). 1
2. [B80] T. Beyer and S. M. Hedetniemi, Constant time generation of rooted trees, SIAM J. Comput., 9, (1980), pp.706-712.
3. [G93] L. A. Goldberg, Efficient algorithms for listing combinatorial structures, Cambridge University Press, New York, (1993).