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

DOI10.1007/978-3-642-00202-1_13zbMath1211.05170OpenAlexW1480703573MaRDI QIDQ3605493

Yota Otachi, Katsuhisa Yamanaka, Shin-ichi Nakano

Publication date: 24 February 2009

Published in: WALCOM: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-00202-1_13

zbMATH Keywords

algorithmgraphenumerationordered treefamily tree

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Efficient tree decomposition of high-rank tensors

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient generation of triconnected plane triangulations.
• Efficient generation of plane trees.
• Reverse search for enumeration
• Generating rooted and free plane trees
• How to Obtain the Complete List of Caterpillars
• Generating trees withnnodes andmleaves
• A binary tree representation and related algorithms for generating integer partitions
• Constant Time Generation of Rooted Trees
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• Generating Trees and Other Combinatorial Objects Lexicographically
• Fast algorithms for genegrating integer partitions
• Efficient Algorithms for Listing Combinatorial Structures
• Isomorph-Free Exhaustive Generation
• Loopless Generation of Trees with Specified Degrees
• Constant Time Generation of Free Trees
• Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence
• Listing All Plane Graphs
• Graph-Theoretic Concepts in Computer Science
• Graph-Theoretic Concepts in Computer Science