Amortized efficiency of ranking and unranking left-child sequences in lexicographic order
DOI10.1007/978-3-319-48749-6_37zbMATH Open1483.68097OpenAlexW2546335103MaRDI QIDQ2958342FDOQ2958342
Authors: Kung-Jui Pai, Ro-Yu Wu, Jou-Ming Chang, 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
Recommendations
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
- A constant amortized time algorithm for generating left-child sequences in lexicographic order
- A note on generating binary trees inA-order andB-order
- Ranking and Unranking of AVL-Trees
- A loopless algorithm for generating multiple binary tree sequences simultaneously
binary treeslexicographic orderranking algorithmsamortized costleft-child sequencesunranking algorithms
Cites Work
- Title not available (Why is that?)
- 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
- A survey in binary tree codings
- On the loopless generation of binary tree sequences
- A loopless algorithm for generating multiple binary tree sequences simultaneously
- Enumerating, Ranking and Unranking Binary Trees
- On Rotations and the Generation of Binary Trees
- A Survey of Combinatorial Gray Codes
- Loopless Algorithms for Generating Permutations, Combinations, and Other Combinatorial Configurations
- Rank and select revisited and extended
- Optimal lower bounds for rank and select indexes
- Generating Trees and Other Combinatorial Objects Lexicographically
- Ranking and Listing Algorithms for k-Ary Trees
- Generating t-Ary Trees Lexicographically
- Ranking and unranking of non-regular trees with a prescribed branching sequence
- Left distance binary tree representations
- A CAT algorithm for generating permutations with a fixed number of inversions
- Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order
- Binary tree gray codes
- Generating bracelets in constant amortized time
- A loopless Gray code for rooted trees
Cited In (2)
This page was built for publication: Amortized efficiency of ranking and unranking left-child sequences in lexicographic order
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2958342)
