Ranking and unranking of non-regular trees with a prescribed branching sequence
type: Item
instance of: scholarly article
title: Ranking and unranking of non-regular trees with a prescribed branching sequence
zbMATH Open document ID: 1217.05061
author: Ro-Yu Wu
author: Jou-Ming Chang
author: Chir-Ho Chang
published in: Mathematical and Computer Modelling
publication date: 2011-07-21T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 5929973
zbMATH Keywords: non-regular trees
zbMATH Keywords: enumeration algorithms
zbMATH Keywords: ranking/unranking algorithms
zbMATH Keywords: constant amortized time
MaRDI profile type: Publication
full work available at URL: j.mcm.2010.12.019
OpenAlex ID: W1984552522
cites work: Efficient Algorithms for Listing Combinatorial Structures
cites work: Q5585020
cites work: Q4522102
cites work: Q3470467
cites work: Generation oft-ary trees with Ballot-sequences*
cites work: Efficient Generation of k-ary Trees in Natural Order
cites work: Enumerating, Ranking and Unranking Binary Trees
cites work: Generating t-Ary Trees Lexicographically
cites work: Generating Binary Trees Lexicographically
cites work: Ranking and Listing Algorithms for k-Ary Trees
cites work: Generating t-ary trees in A-order
cites work: Generating Regular k-ary Trees Efficiently
cites work: On generating \(k\)-ary trees in computer representation
cites work: Lexicographic generation of ordered trees
cites work: Generating binary trees using rotations
cites work: A Simple Algorithm for Generating Non-regular Trees in Lexicographic Order
cites work: Generating Trees and Other Combinatorial Objects Lexicographically
cites work: A methodology for plane tree enumeration
cites work: ECO:a methodology for the enumeration of combinatorial objects
DOI: 10.1016/J.MCM.2010.12.019
description: scientific article; zbMATH DE number 5929973