Ranking and Unranking of Non-regular Trees
From MaRDI portal
Publication:3792254
DOI10.1080/02522667.1988.10698906zbMath0647.68066MaRDI QIDQ3792254
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
05C05: Trees
68R10: Graph theory (including graph drawing) in computer science
68W99: Algorithms in computer science
Related Items
Generating binary trees in A-order from codewords defined on a four-letter alphabet, Coding Binary Trees by Words over an Alphabet with Four Letters
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