Loopless generation of \(k\)-ary tree sequences
From MaRDI portal
Publication:1339380
DOI10.1016/0020-0190(94)00149-9zbMath0938.68755MaRDI QIDQ1339380
Publication date: 21 June 2000
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(94)00149-9
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
68P05: Data structures
Related Items
Ranking and unrankingk-ary trees with a 4k –4 letter alphabet, A-order generation of k-ary trees with a 4k–4 letter alphabet, Loop Free Generation ofK-Ary Trees, Shifts and loopless generation of \(k\)-ary trees, On the loopless generation of binary tree sequences, A loopless algorithm for generating multiple binary tree sequences simultaneously, The rotation graph of \(k\)-ary trees is Hamiltonian, On generating \(k\)-ary trees in computer representation, Efficient loopless generation of Gray codes for \(k\)-ary trees., A Loopless Algorithm for Generating Multiple Binary Tree Sequences Simultaneously
Cites Work
- Generating t-ary trees in A-order
- A loopless algorithm for generating binary tree sequences
- Enumerating Ordered Trees Lexicographically
- Enumerating, Ranking and Unranking Binary Trees
- Generating binary trees using rotations
- A note on generating binary trees inA-order andB-order
- Efficient Generation of k-ary Trees in Natural Order
- A numbering system for binary trees
- Generation of Binary Trees from Ballot Sequences
- Generating t-Ary Trees Lexicographically
- On Rotations and the Generation of Binary Trees