Efficient enumeration of ordered trees with k leaves

DOI10.1016/J.TCS.2011.01.017MaRDI QIDQ441889zbMATH OpenOpenAlexFDO

Authors Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano

Publication date 8 August 2012

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2011.01.017

zbMATH Keywords

enumerationgraph algorithmordered treefamily tree

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Enumeration in graph theory (05C30)

Recommendations

• Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
• Generating ordered trees
• Efficient generation of plane trees.
• Uniform Generation of Rooted Ordered Trees with Prescribed Degrees
• scientific article; zbMATH DE number 3961006

Cites work

• scientific article; zbMATH DE number 3864523 (Why is no real title available?)
• scientific article; zbMATH DE number 4137767 (Why is no real title available?)
• scientific article; zbMATH DE number 3752234 (Why is no real title available?)
• scientific article; zbMATH DE number 1268810 (Why is no real title available?)
• scientific article; zbMATH DE number 1305528 (Why is no real title available?)
• scientific article; zbMATH DE number 2176112 (Why is no real title available?)
• A binary tree representation and related algorithms for generating integer partitions
• Constant Time Generation of Free Trees
• Constant Time Generation of Rooted Trees
• Efficient Algorithms for Listing Combinatorial Structures
• Efficient generation of plane trees.
• Efficient generation of triconnected plane triangulations.
• Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
• Fast algorithms for genegrating integer partitions
• Generating Trees and Other Combinatorial Objects Lexicographically
• Generating rooted and free plane trees
• Generating trees withnnodes andmleaves
• Graph-Theoretic Concepts in Computer Science
• Graph-Theoretic Concepts in Computer Science
• How to Obtain the Complete List of Caterpillars
• Isomorph-Free Exhaustive Generation
• Listing All Plane Graphs
• Loopless Generation of Trees with Specified Degrees
• Multiset Permutations and Loopless Generation of Ordered Trees with Specified Degree Sequence
• Reverse search for enumeration

Cited in

(9)

• On enumerating tree permutations in natural order
• Generation, ranking and unranking of ordered trees with degree bounds
• Family Trees for Enumeration
• Enumerating Ordered Trees Lexicographically
• Listing all spanning trees in Halin graphs -- sequential and parallel view
• Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
• More Efficient Algorithm for Ordered Tree Inclusion
• Enumerative sequences of leaves and nodes in rational trees
• Enumerating \(k\)-way trees

This page was built for publication: Efficient enumeration of ordered trees with \(k\) leaves

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q441889)