Efficient enumeration of ordered trees with k leaves
From MaRDI portal
Publication:441889
DOI10.1016/J.TCS.2011.01.017zbMATH Open1246.05077OpenAlexW2011576097MaRDI QIDQ441889FDOQ441889
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
Recommendations
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Enumeration in graph theory (05C30)
Cites Work
- Title not available (Why is that?)
- Fast algorithms for genegrating integer partitions
- Title not available (Why is that?)
- Reverse search for enumeration
- Title not available (Why is that?)
- Efficient Algorithms for Listing Combinatorial Structures
- Isomorph-Free Exhaustive Generation
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient generation of plane trees.
- Efficient generation of triconnected plane triangulations.
- Generating rooted and free plane trees
- How to Obtain the Complete List of Caterpillars
- Listing All Plane Graphs
- Generating trees withnnodes andmleaves
- A binary tree representation and related algorithms for generating integer partitions
- Constant Time Generation of Rooted Trees
- Title not available (Why is that?)
- Every one a Winner or how to Avoid Isomorphism Search when Cataloguing Combinatorial Configurations
- Generating Trees and Other Combinatorial Objects Lexicographically
- 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
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
Cited In (9)
- On enumerating tree permutations in natural order
- Enumerating \(k\)-way trees
- Family Trees for Enumeration
- Generation, ranking and unranking of ordered trees with degree bounds
- Listing all spanning trees in Halin graphs -- sequential and parallel view
- Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
- Enumerating Ordered Trees Lexicographically
- More Efficient Algorithm for Ordered Tree Inclusion
- Enumerative sequences of leaves and nodes in rational 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)
