Chapter

WALCOM: Algorithms and Computation

Volume 5431 of the series Lecture Notes in Computer Science pp 141-150

Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)

  • Katsuhisa YamanakaAffiliated withLancaster UniversityGraduate School of Information Systems, The University of Electro-Communications
  • , Yota OtachiAffiliated withLancaster UniversityDepartment of Computer Science, Gunma University
  • , Shin-ichi NakanoAffiliated withLancaster UniversityDepartment of Computer Science, Gunma University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

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.

Keywords

graph algorithm ordered tree enumeration family tree