Generating t-ary trees in A-order

DOI10.1016/0020-0190(88)90027-0zbMath0646.68082OpenAlexW2062675641MaRDI QIDQ1104107

Frank Ruskey, Dominique Roelants van Baronaigien

Publication date: 1988

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(88)90027-0

zbMATH Keywords

rankingbijectioncombinatorial generationA-ordert-ary trees

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph theory (including graph drawing) in computer science (68R10)

Related Items (14)

Loopless generation of \(k\)-ary tree sequences ⋮ Shifts and loopless generation of \(k\)-ary trees ⋮ Loop Free Generation ofK-Ary Trees ⋮ Cool-lex order and \(k\)-ary Catalan structures ⋮ Generating binary trees in A-order from codewords defined on a four-letter alphabet ⋮ A loopless algorithm for generating binary tree sequences ⋮ Ranking and unrankingk-ary trees with a 4k –4 letter alphabet ⋮ Generating permutations with given ups and downs ⋮ A new algorithm for generation of different types of RNA ⋮ Ranking and unranking of non-regular trees with a prescribed branching sequence ⋮ Staircase tilings and \(k\)-Catalan structures ⋮ A-order generation of k-ary trees with a 4k–4 letter alphabet ⋮ Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order ⋮ Parallel generation of í-ary trees with ballot-sequences

Cites Work

• Unnamed Item
• Lexicographic generation of ordered trees
• A note on generating binary trees inA-order andB-order
• A numbering system for binary trees
• Generating t-Ary Trees Lexicographically

This page was built for publication: Generating t-ary trees in A-order