Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order (Q2321597)
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 7097840
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order |
scientific article; zbMATH DE number 7097840 |
Statements
Efficient generation, ranking, and unranking of \((k,m)\)-ary trees in B-order (English)
0 references
23 August 2019
0 references
\((k,m)\)-ary trees
0 references
tree generation
0 references
ranking
0 references
unranking
0 references
0 references
0 references
0.95249342918396
0 references
0.8660452365875244
0 references
0.8514158129692078
0 references
0.8488487601280212
0 references
0.8473861217498779
0 references
