Improved algorithms for ranking and unranking \((k, m)\)-ary trees in B-order (Q2082174): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/s10878-019-00469-z / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2983434262 / rank | |||
Normal rank | |||
Revision as of 19:11, 19 March 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
