A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order
From MaRDI portal
Publication:4632217
DOI10.1007/978-3-319-59605-1_20zbMath1494.68074DBLPconf/faw/PaiCW17OpenAlexW2618088226WikidataQ60691781 ScholiaQ60691781MaRDI QIDQ4632217
Kung-Jui Pai, Jou-Ming Chang, Ro-Yu Wu
Publication date: 26 April 2019
Published in: Frontiers in Algorithmics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-59605-1_20
lexicographic orderbinary treesgeneration algorithmsamortized costleft-child sequencesconstant-amortized-time algorithm
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- On the loopless generation of binary tree sequences
- A loopless algorithm for generating multiple binary tree sequences simultaneously
- Rotation sequences and edge-colouring of binary tree pairs
- A CAT algorithm for generating permutations with a fixed number of inversions
- Lexicographic generation of ordered trees
- A loopless algorithm for generating binary tree sequences
- Morphing simple polygons
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
- A Survey on Binary Tree Codings
- Generating Bracelets in Constant Amortized Time
- Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order
- Enumerating, Ranking and Unranking Binary Trees
- Binary tree gray codes
- Generating Binary Trees Lexicographically
- Generating Trees and Other Combinatorial Objects Lexicographically
- On Rotations and the Generation of Binary Trees
- A Survey of Combinatorial Gray Codes
- Simple constant amortized time generation of fixed length numeric partitions
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
This page was built for publication: A Constant Amortized Time Algorithm for Generating Left-Child Sequences in Lexicographic Order
