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

DOI10.1080/02522667.1997.10699333MaRDI QIDQ4366347zbMATH OpenOpenAlexFDO

Authors

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)

Recommendations

• Lexicographic Enumeration of k-ary Trees
• Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order
• Efficient Generation of k-ary Trees in Natural Order
• Generating t-ary trees in A-order

Cites work

• A-order generation of k-ary trees with a 4k–4 letter alphabet
• 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
• Generating t-ary trees in A-order
• Generating trees withnnodes andmleaves
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• Lexicographic generation of ordered trees
• Loopless generation of \(k\)-ary tree sequences

Cited in

(12)

• Cool-lex order and k-ary Catalan structures
• Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order
• Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order
• Ranking and unranking algorithms for loopless generation of t-ary trees
• Ranking and loopless generation of k-ary Dyck words in cool-lex order
• Lexicographic Enumeration of k-ary Trees
• scientific article; zbMATH DE number 3974971 (Why is no real title available?)
• Generating trees withnnodes andmleaves
• Efficient Generation of k-ary Trees in Natural Order
• Generation, ranking and unranking of ordered trees with degree bounds
• Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order
• Improved algorithms for ranking and unranking \((k, m)\)-ary trees

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4366347)