Back to Search Start Over

Efficient enumeration of ordered trees with leaves

Authors :
Yamanaka, Katsuhisa
Otachi, Yota
Nakano, Shin-ichi
Source :
Theoretical Computer Science. Jul2012, Vol. 442, p22-27. 6p.
Publication Year :
2012

Abstract

Abstract: This paper presents a simple algorithm to generate all ordered trees with exactly vertices including exactly leaves. The best known algorithm generates such trees in time per tree, whereas our algorithm generates such trees in time per tree in the worst case. [Copyright &y& Elsevier]

Subjects

Subjects :
*COMBINATORIAL enumeration problems
*TREE graphs
*COMPUTER algorithms
*LEAVES
*ALGORITHMS
*COMBINATORICS

Details

Language :
English
ISSN :
03043975
Volume :
442
Database :
Academic Search Index
Journal :
Theoretical Computer Science
Publication Type :
Academic Journal
Accession number :
76339954
Full Text :
https://doi.org/10.1016/j.tcs.2011.01.017
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details