Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order (Q2082174): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 22:15, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order |
scientific article |
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
