Lexicographic generation of ordered trees
From MaRDI portal
Publication:1133548
DOI10.1016/0304-3975(80)90073-0zbMath0422.05026OpenAlexW1964195795WikidataQ106200575 ScholiaQ106200575MaRDI QIDQ1133548
Publication date: 1980
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(80)90073-0
Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)
Related Items (49)
On the generation of binary trees inA-order ⋮ On the generation of binary trees from (0–1) codes ⋮ On succinct representations of binary trees ⋮ A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations ⋮ An Eades-McKay algorithm for well-formed parentheses strings ⋮ On the lexicographical generation of compressed codes ⋮ On random and adaptive parallel generation of combinatorial objects ⋮ Generation of binary trees from (0-1) codes ⋮ Generating ordered trees ⋮ Generating t-ary trees in A-order ⋮ A note on the generation of binary trees ⋮ A COST-OPTIMAL EREW BREADTH-FIRST ALGORITHM FOR ORDERED TREES, WITH APPLICATIONS∗ ⋮ Time-optimal tree computations on sparse meshes ⋮ On the subtree isomorphism problem for ordered trees ⋮ On the generation ofP-sequences ⋮ Introducing the closure structure and the GDPM algorithm for mining and understanding a tabular dataset ⋮ Coding Binary Trees by Words over an Alphabet with Four Letters ⋮ Random generation of colored trees ⋮ Generating binary trees in A-order from codewords defined on a four-letter alphabet ⋮ Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order ⋮ Encoding trees by linear recurrence sequences ⋮ Unnamed Item ⋮ Some comments on the subtree isomorphism problem for ordered trees ⋮ Single-crossover recombination and ancestral recombination trees ⋮ A note on generating binary trees inA-order andB-order ⋮ On enumerating tree permutations in natural order ⋮ A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order ⋮ A loopless algorithm for generating binary tree sequences ⋮ An efficient algorithm for some tree matching problems ⋮ Ranking and unrankingk-ary trees with a 4k –4 letter alphabet ⋮ Gray codes and lexicographical combinatorial generation for nonnesting and sparse nonnesting set partitions ⋮ A new algorithm for generation of different types of RNA ⋮ Arithmetic for rooted trees ⋮ Time-optimal tree computations on sparse meshes ⋮ Ranking and unranking of non-regular trees with a prescribed branching sequence ⋮ Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order ⋮ Generating alternating permutations lexicographically ⋮ Generating random binary trees -- a survey ⋮ 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 ⋮ Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order ⋮ Listing and counting subtrees of equal size of a binary tree ⋮ Sur la génération des arbres binaires par les B-suites ⋮ Linear time tree codes ⋮ Permutation representation of k-ary trees ⋮ Generating binary trees of bounded height ⋮ On generating \(k\)-ary trees in computer representation ⋮ Efficient loopless generation of Gray codes for \(k\)-ary trees.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A problem of arrangements
- A numbering system for binary trees
- Generating Binary Trees Lexicographically
- Generation of Binary Trees from Ballot Sequences
- Ranking and Listing Algorithms for k-Ary Trees
- Generating t-Ary Trees Lexicographically
- Generating Trees and Other Combinatorial Objects Lexicographically
- A note on plane trees
- Correspondences between plane trees and binary sequences
This page was built for publication: Lexicographic generation of ordered trees
