Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order (Q2082174)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order |
scientific article; zbMATH DE number 7595902
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order |
scientific article; zbMATH DE number 7595902 |
Statements
Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order (English)
0 references
4 October 2022
0 references
\((k, m)\)-ary trees
0 references
ranking/unranking algorithms
0 references
Zaks' sequences
0 references
RD-sequences
0 references
lexicographic/reverse-lexicographic order
0 references
amortized cost
0 references
0 references
0 references
0 references
