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

DOI10.1016/J.MCM.2010.12.019MaRDI QIDQ552163zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

constant amortized timeenumeration algorithmsnon-regular treesranking/unranking algorithms

Mathematics Subject Classification ID

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

Recommendations

• Ranking and Unranking of Non-regular Trees
• Ranking and unranking trees using regular reductions
• A Simple Algorithm for Generating Non-regular Trees in Lexicographic Order
• scientific article; zbMATH DE number 3961006
• Generation, ranking and unranking of ordered trees with degree bounds

Cites work

• scientific article; zbMATH DE number 4137767 (Why is no real title available?)
• scientific article; zbMATH DE number 1545695 (Why is no real title available?)
• scientific article; zbMATH DE number 3303654 (Why is no real title available?)
• A Simple Algorithm for Generating Non-regular Trees in Lexicographic Order
• A methodology for plane tree enumeration
• ECO:a methodology for the enumeration of combinatorial objects
• Efficient Algorithms for Listing Combinatorial Structures
• Efficient Generation of k-ary Trees in Natural Order
• Enumerating, Ranking and Unranking Binary Trees
• Generating t-Ary Trees Lexicographically
• Generating Binary Trees Lexicographically
• Generating Regular k-ary Trees Efficiently
• Generating Trees and Other Combinatorial Objects Lexicographically
• Generating binary trees using rotations
• Generating t-ary trees in A-order
• Generation oft-ary trees with Ballot-sequences^*
• Lexicographic generation of ordered trees
• On generating \(k\)-ary trees in computer representation
• Ranking and Listing Algorithms for k-Ary Trees

Cited in

(13)

• Cool-lex order and k-ary Catalan structures
• Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order
• scientific article; zbMATH DE number 1223556 (Why is no real title available?)
• 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)