How to obtain the complete list of caterpillars

Authors:
Yosuke Kikuchi;Hiroyuki Tanaka;Shin-Ichi Nakano;Yukio Shibata
Affiliations:
Department of Computer Science, Gunma University, Kiryu, Gunma, Japan;Department of Computer Science, Gunma University, Kiryu, Gunma, Japan;Department of Computer Science, Gunma University, Kiryu, Gunma, Japan;Department of Computer Science, Gunma University, Kiryu, Gunma, Japan
Venue:
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Year:
2003

Citing 5
Cited 2

Constant time generation of free trees

SIAM Journal on Computing
Graph Theory, 1736-1936

Graph Theory, 1736-1936
On the number of spanning trees of a multi-complete/star related graph

Information Processing Letters
Enumerating alternating trees

Journal of Combinatorial Theory Series A
Efficient generation of plane trees

Information Processing Letters

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

WALCOM '09 Proceedings of the 3rd International Workshop on Algorithms and Computation
Efficient enumeration of ordered trees with k leaves

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a simple algorithm to generate all caterpillars without repetition. Also some other generation algorithms are presented. Our algorithm generates each caterpillar in a constant time per caterpillar.