Generating trees withnnodes andmleaves
From MaRDI portal
Publication:3805926
DOI10.1080/00207168708803562zbMath0657.68072OpenAlexW2088513892MaRDI QIDQ3805926
No author found.
Publication date: 1987
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168708803562
Searching and sorting (68P10) Graph theory (including graph drawing) in computer science (68R10) Data structures (68P05)
Related Items
Unnamed Item ⋮ Efficient enumeration of ordered trees with \(k\) leaves ⋮ Ranking and unrankingk-ary trees with a 4k –4 letter alphabet ⋮ A new algorithm for generation of different types of RNA ⋮ Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract) ⋮ Generation oft-ary trees with Ballot-sequences* ⋮ Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order ⋮ Parallel generation of í-ary trees with ballot-sequences ⋮ Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order ⋮ On generating B-trees with constant average delay and in lexicographic order
Cites Work
- Sur la génération des arbres binaires par les B-suites
- A correspondence between ordered trees and noncrossing partitions
- Enumerations of ordered trees
- Enumerating, Ranking and Unranking Binary Trees
- A note on generating binary trees inA-order andB-order
- Ranking and Listing Algorithms for k-Ary Trees
- Generating t-Ary Trees Lexicographically
- Generating Trees and Other Combinatorial Objects Lexicographically
