Name
Abstract | ||
|---|---|---|
This paper presents a simple algorithm to generate all ordered trees with exactly n vertices including exactly k leaves. The best known algorithm generates such trees in O(n-k) time per tree, whereas our algorithm generates such trees in O(1) time per tree in the worst case. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.tcs.2011.01.017 | Theor. Comput. Sci. |
Keywords | DocType | Volume |
n vertex,known algorithm,Family tree,Graph,worst case,Ordered tree,Algorithm,efficient enumeration,Enumeration,simple algorithm | Journal | 442, |
ISSN | Citations | PageRank |
Theoretical Computer Science | 0 | 0.34 |
References | Authors | |
11 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Katsuhisa Yamanaka | 1 | 60 | 15.73 |
| Yota Otachi | 2 | 161 | 37.16 |
| Shin-ichi Nakano | 3 | 246 | 24.40 |