Ranking and unranking of non-regular trees with a prescribed branching sequence
From MaRDI portal
Publication:552163
DOI10.1016/J.MCM.2010.12.019zbMATH Open1217.05061OpenAlexW1984552522MaRDI QIDQ552163FDOQ552163
Authors: Ro-Yu Wu, Jou-Ming Chang, Chir-Ho Chang 
Publication date: 21 July 2011
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.mcm.2010.12.019
Recommendations
Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Generating t-ary trees in A-order
- Lexicographic generation of ordered trees
- On generating \(k\)-ary trees in computer representation
- Enumerating, Ranking and Unranking Binary Trees
- Generating binary trees using rotations
- Efficient Algorithms for Listing Combinatorial Structures
- ECO:a methodology for the enumeration of combinatorial objects
- Title not available (Why is that?)
- A methodology for plane tree enumeration
- Generating Trees and Other Combinatorial Objects Lexicographically
- A Simple Algorithm for Generating Non-regular Trees in Lexicographic Order
- Efficient Generation of k-ary Trees in Natural Order
- Generating Binary Trees Lexicographically
- Ranking and Listing Algorithms for k-Ary Trees
- Generating t-Ary Trees Lexicographically
- Generation oft-ary trees with Ballot-sequences*
- Generating Regular k-ary Trees Efficiently
Cited In (13)
- Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order
- Cool-lex order and \(k\)-ary Catalan structures
- Title not available (Why is that?)
- Ranking and unranking trees using regular reductions
- Ranking and Unranking of Non-regular Trees
- Amortized efficiency of ranking and unranking left-child sequences in lexicographic order
- Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees
- Generation, ranking and unranking of ordered trees with degree bounds
- Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms
- A Simple Algorithm for Generating Non-regular Trees in Lexicographic Order
- Amortized efficiency of generation, ranking and unranking left-child sequences in lexicographic order
- Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order
- Two Algorithms for Unranking Arborescences
This page was built for publication: Ranking and unranking of non-regular trees with a prescribed branching sequence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q552163)
