Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order
From MaRDI portal
Publication:2958342
DOI10.1007/978-3-319-48749-6_37zbMath1483.68097OpenAlexW2546335103MaRDI QIDQ2958342
Jou-Ming Chang, Kung-Jui Pai, Ro-Yu Wu, Shun-Chieh Chang
Publication date: 1 February 2017
Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-48749-6_37
lexicographic orderbinary treesranking algorithmsamortized costleft-child sequencesunranking algorithms
Related Items (1)
Cites Work
- Unnamed Item
- On the loopless generation of binary tree sequences
- A loopless algorithm for generating multiple binary tree sequences simultaneously
- Ranking and unranking of non-regular trees with a prescribed branching sequence
- 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
- Efficient loopless generation of Gray codes for \(k\)-ary trees.
- A linear time algorithm for binary tree sequences transformation using left-arm and right-arm rotations
- Rank and select revisited and extended
- Optimal lower bounds for rank and select indexes
- A Survey on Binary Tree Codings
- Generating Bracelets in Constant Amortized Time
- A loopless Gray code for rooted trees
- Enumerating, Ranking and Unranking Binary Trees
- Binary tree gray codes
- Ranking and Listing Algorithms for k-Ary Trees
- Generating t-Ary Trees Lexicographically
- Generating Trees and Other Combinatorial Objects Lexicographically
- On Rotations and the Generation of Binary Trees
- A Survey of Combinatorial Gray Codes
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order
- Left distance binary tree representations
This page was built for publication: Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order
