Ranking and Listing Algorithms for k-Ary Trees
From MaRDI portal
Publication:4167575
DOI10.1137/0207039zbMath0386.68045OpenAlexW2046448824MaRDI QIDQ4167575
Publication date: 1978
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0207039
Trees (05C05) Discrete mathematics in relation to computer science (68R99) Algorithms in computer science (68W99)
Related Items (23)
On random and adaptive parallel generation of combinatorial objects ⋮ Generating ordered trees ⋮ Practical algorithms to rank necklaces, Lyndon words, and de Bruijn sequences ⋮ Coding Binary Trees by Words over an Alphabet with Four Letters ⋮ 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 ⋮ A note on generating binary trees inA-order andB-order ⋮ On enumerating tree permutations in natural order ⋮ Generating trees withnnodes andmleaves ⋮ 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 ⋮ Counting labels in binary trees ⋮ Staircase tilings and \(k\)-Catalan structures ⋮ Listing and counting subtrees of equal size of a binary tree ⋮ Sur la génération des arbres binaires par les B-suites ⋮ Permutation representation of k-ary trees ⋮ Generating binary trees of bounded height ⋮ Fast algorithms for genegrating integer partitions ⋮ The generation of random, binary unordered trees ⋮ Lexicographic Enumeration of k-ary Trees
This page was built for publication: Ranking and Listing Algorithms for k-Ary Trees
