Generating t-Ary Trees Lexicographically

DOI10.1137/0207034zbMath0386.68062OpenAlexW4241645849MaRDI QIDQ4167594

Frank Ruskey

Publication date: 1978

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/0207034

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Related Items (27)

Loopless generation of \(k\)-ary tree sequences ⋮ Loop Free Generation ofK-Ary Trees ⋮ Generating t-ary trees in A-order ⋮ A loop-free two-close Gray-code algorithm for listing \(k\)-ary Dyck words ⋮ A one-to-one correspondence between two classes of ordered trees ⋮ Lexicographic generation of ordered trees ⋮ Cool-lex order and \(k\)-ary Catalan structures ⋮ Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order ⋮ Unnamed Item ⋮ Generating trees withnnodes andmleaves ⋮ A new algorithm for generation of different types of RNA ⋮ Chords, trees and permutations ⋮ Ranking and unranking of non-regular trees with a prescribed branching sequence ⋮ Optimal binary search trees ⋮ Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order ⋮ Fast random generation of binary, t-ary and other types of trees ⋮ Staircase tilings and \(k\)-Catalan structures ⋮ 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 ⋮ On Level Numbers of t-Ary Trees ⋮ Permutation representation of k-ary trees ⋮ Generating binary trees of bounded height ⋮ On generating B-trees with constant average delay and in lexicographic order ⋮ On generating \(k\)-ary trees in computer representation ⋮ The generation of random, binary unordered trees ⋮ Lexicographic Enumeration of k-ary Trees

This page was built for publication: Generating t-Ary Trees Lexicographically