A loopless algorithm for generating \((k, m)\)-ary trees in gray-code order (Q2037975)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A loopless algorithm for generating \((k, m)\)-ary trees in gray-code order |
scientific article; zbMATH DE number 7370006
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A loopless algorithm for generating \((k, m)\)-ary trees in gray-code order |
scientific article; zbMATH DE number 7370006 |
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
0.9457468
0 references
0.9401403
0 references
0.9397885
0 references
0.9021067
0 references
0 references
0 references
0.8912878
0 references
0.88682306
0 references
0.87868965
0 references
