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

Authors:
Katsuhisa Yamanaka;Yota Otachi;Shin-Ichi Nakano
Affiliations:
Graduate School of Information Systems, The University of Electro-Communications, Tokyo, Japan 182-8585;Department of Computer Science, Gunma University, Gunma, Japan 376-8515;Department of Computer Science, Gunma University, Gunma, Japan 376-8515
Venue:
WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Year:
2009

Citing 18
Cited 1

Constant time generation of free trees

SIAM Journal on Computing
Efficient algorithms for listing combinatorial structures

Efficient algorithms for listing combinatorial structures
Reverse search for enumeration

Discrete Applied Mathematics - Special volume: first international colloquium on graphs and optimization (GOI), 1992
Isomorph-free exhaustive generation

Journal of Algorithms
The advantages of forward thinking in generating rooted and free trees

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Multiset permutations and loopless generation of ordered trees with specified degree sequence

Journal of Algorithms
Efficient generation of plane trees

Information Processing Letters
Efficient Generation of Plane Triangulations without Repetitions

ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Efficient generation of triconnected plane triangulations

Computational Geometry: Theory and Applications
Combinatorial Algorithms: Theory and Practice

Combinatorial Algorithms: Theory and Practice
The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming)

The Art of Computer Programming, Volume 4, Fascicle 2: Generating All Tuples and Permutations (Art of Computer Programming)
The Art of Computer Programming, Volume 4, Fascicle 4: Generating All Trees--History of Combinatorial Generation (Art of Computer Programming)

The Art of Computer Programming, Volume 4, Fascicle 4: Generating All Trees--History of Combinatorial Generation (Art of Computer Programming)
Generating rooted and free plane trees

ACM Transactions on Algorithms (TALG)
Constant Time Generation of Integer Partitions

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
How to obtain the complete list of caterpillars

COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Listing all plane graphs

WALCOM'08 Proceedings of the 2nd international conference on Algorithms and computation
Generating colored trees

WG'05 Proceedings of the 31st international conference on Graph-Theoretic Concepts in Computer Science
Constant time generation of trees with specified diameter

WG'04 Proceedings of the 30th international conference on Graph-Theoretic Concepts in Computer Science

The semigroups of order 10

CP'12 Proceedings of the 18th international conference on Principles and Practice of Constraint Programming

Quantified Score

Hi-index	0.00

Visualization

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.