Generation oft-ary trees with Ballot-sequences*
From MaRDI portal
Publication:4462115
DOI10.1080/00207160310001624214zbMath1041.05069OpenAlexW2003907332MaRDI QIDQ4462115
No author found.
Publication date: 18 May 2004
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160310001624214
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Modular lattices, Desarguesian lattices (06C05)
Related Items
Cool-lex order and \(k\)-ary Catalan structures ⋮ Ranking and unranking of non-regular trees with a prescribed branching sequence ⋮ Staircase tilings and \(k\)-Catalan structures ⋮ Parallel generation of í-ary trees with ballot-sequences ⋮ Generating 2-Gray codes for ballot sequences in constant amortized time
Cites Work
- Unnamed Item
- On the loopless generation of binary tree sequences
- Lexicographic generation of ordered trees
- On a correspondence between binary trees and a certain type of permutation
- Loopless generation of Gray codes for \(k\)-ary trees
- Efficient loopless generation of Gray codes for \(k\)-ary trees.
- On the generation ofP-sequences
- A note on generating binary trees inA-order andB-order
- Generating trees withnnodes andmleaves
- Generation of Binary Trees from Ballot Sequences
- Generating t-Ary Trees Lexicographically
- On the generation of binary trees from (0–1) codes
This page was built for publication: Generation oft-ary trees with Ballot-sequences*
