Efficient enumeration of ordered trees with \(k\) leaves
From MaRDI portal
Publication:441889
DOI10.1016/j.tcs.2011.01.017zbMath1246.05077OpenAlexW2011576097MaRDI QIDQ441889
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
Trees (05C05) Enumeration in graph theory (05C30) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Family Trees for Enumeration ⋮ Listing all spanning trees in Halin graphs — sequential and Parallel view ⋮ Unnamed Item
Cites Work
- 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
- 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
- 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
- Graph-Theoretic Concepts in Computer Science
- Graph-Theoretic Concepts in Computer Science
