Ranking and unrankingk-ary trees with a 4k –4 letter alphabet
From MaRDI portal
Publication:4366347
DOI10.1080/02522667.1997.10699333zbMATH Open0886.68106OpenAlexW2077492027MaRDI QIDQ4366347FDOQ4366347
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Generating t-ary trees in A-order
- Lexicographic generation of ordered trees
- Loopless generation of \(k\)-ary tree sequences
- Generating trees withnnodes andmleaves
- 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
- A-order generation of k-ary trees with a 4k–4 letter alphabet
Cited In (12)
- Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order
- Cool-lex order and \(k\)-ary Catalan structures
- Generating trees withnnodes andmleaves
- Short Note: An Efficient Implementation of Permutation Backtracking in Lexicographic Order
- Ranking and unranking algorithms for loopless generation of \(t\)-ary trees
- Generation, ranking and unranking of ordered trees with degree bounds
- Improved algorithms for ranking and unranking \((k, m)\)-ary trees
- Title not available (Why is that?)
- Lexicographic Enumeration of k-ary Trees
- Efficient Generation of k-ary Trees in Natural Order
- Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order
- Ranking and loopless generation of \(k\)-ary Dyck words in cool-lex order
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)
