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

  • Katsuhisa Yamanaka
  • Yota Otachi
  • Shin-ichi Nakano
Conference paper

DOI: 10.1007/978-3-642-00202-1_13

Part of the Lecture Notes in Computer Science book series (LNCS, volume 5431)
Cite this paper as:
Yamanaka K., Otachi Y., Nakano S. (2009) Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract). In: Das S., Uehara R. (eds) WALCOM: Algorithms and Computation. WALCOM 2009. Lecture Notes in Computer Science, vol 5431. Springer, Berlin, Heidelberg

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2009

Authors and Affiliations

  • Katsuhisa Yamanaka
    • 1
  • Yota Otachi
    • 2
  • Shin-ichi Nakano
    • 2
  1. 1.Graduate School of Information SystemsThe University of Electro-CommunicationsTokyoJapan
  2. 2.Department of Computer ScienceGunma UniversityGunmaJapan

Personalised recommendations