Ranking and unrankingk-ary trees with a 4k –4 letter alphabet

DOI10.1080/02522667.1997.10699333zbMath0886.68106OpenAlexW2077492027MaRDI QIDQ4366347

No author found.

Publication date: 4 May 1998

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

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

zbMATH Keywords

unranking algorithms

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• Unnamed Item
• Generating t-ary trees in A-order
• Lexicographic generation of ordered trees
• Loopless generation of \(k\)-ary tree sequences
• Generating trees withnnodes andmleaves
• 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
• A-order generation of k-ary trees with a 4k–4 letter alphabet

This page was built for publication: Ranking and unrankingk-ary trees with a 4k –4 letter alphabet