A loopless algorithm for generating \((k, m)\)-ary trees in gray-code order (Q2037975): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 20:11, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A loopless algorithm for generating \((k, m)\)-ary trees in gray-code order |
scientific article |
Statements
A loopless algorithm for generating \((k, m)\)-ary trees in gray-code order (English)
0 references
8 July 2021
0 references
loopless algorithms
0 references
\((k, m)\)-ary trees
0 references
amortized analysis
0 references
gray-codes
0 references
Zaks' sequences
0 references
