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 the normal view instead:
scientific article; zbMATH DE number 7595902
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| 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
0.95249342918396
0 references
0.8474213480949402
0 references
0.8158764243125916
0 references
0.8151220679283142
0 references
0.7925496101379395
0 references
