Ranking and unranking of non-regular trees with a prescribed branching sequence

DOI10.1016/j.mcm.2010.12.019zbMath1217.05061OpenAlexW1984552522MaRDI QIDQ552163

Ro-Yu Wu, Chir-Ho Chang, Jou-Ming 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

zbMATH Keywords

ranking/unranking algorithmsconstant amortized timeenumeration algorithmsnon-regular trees

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (8)

Gap terminology and related combinatorial properties for AVL trees and Fibonacci-isomorphic trees ⋮ Cool-lex order and \(k\)-ary Catalan structures ⋮ Generating spanning-tree sequences of a fan graph in lexicographic order and ranking/unranking algorithms ⋮ Amortized Efficiency of Ranking and Unranking Left-Child Sequences in Lexicographic Order ⋮ Unnamed Item ⋮ 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 ⋮ Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generating t-ary trees in A-order
• Lexicographic generation of ordered trees
• A methodology for plane tree enumeration
• On generating \(k\)-ary trees in computer representation
• Enumerating, Ranking and Unranking Binary Trees
• Generating binary trees using rotations
• 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
• Generating Trees and Other Combinatorial Objects Lexicographically
• Efficient Algorithms for Listing Combinatorial Structures
• Generation oft-ary trees with Ballot-sequences^*
• Generating Regular k-ary Trees Efficiently
• ECO:a methodology for the enumeration of combinatorial objects

This page was built for publication: Ranking and unranking of non-regular trees with a prescribed branching sequence