In this paper, we give 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 for each, while our algorithm generates such trees in O(1) time for each in worst case. © Springer-Verlag Berlin Heidelberg 2009.
CITATION STYLE
Yamanaka, K., Otachi, Y., & Nakano, S. I. (2009). Efficient enumeration of ordered trees with K leaves : Extended abstract. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5431 LNCS, pp. 141–150). https://doi.org/10.1007/978-3-642-00202-1_13
Mendeley helps you to discover research relevant for your work.