Ranking and Unranking of Non-regular Trees

DOI10.1080/02522667.1988.10698906zbMath0647.68066OpenAlexW2076462309MaRDI QIDQ3792254

M. C. Er

Publication date: 1988

Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/02522667.1988.10698906

zbMATH Keywords

ordered treesrandom treesrooted treesranking functionnon-regular treesunranking algorithm

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Algorithms in computer science (68W99)

Related Items (2)

Coding Binary Trees by Words over an Alphabet with Four Letters ⋮ Generating binary trees in A-order from codewords defined on a four-letter alphabet

Cites Work

• Unnamed Item
• Unnamed Item
• Generating binary trees of bounded height
• A Note on Generating Well-formed Parenthesis Strings Lexicographically
• Lexicographic Enumeration of k-ary Trees
• On the complexity of calculating factorials
• Enumerating Ordered Trees Lexicographically
• Enumerating, Ranking and Unranking Binary Trees
• A note on generating binary trees inA-order andB-order
• Ranking and Unranking of 2-3 Trees
• Generating Trees and Other Combinatorial Objects Lexicographically
• Ranking and unranking of B-trees

This page was built for publication: Ranking and Unranking of Non-regular Trees