A loopless algorithm for generating \((k, m)\)-ary trees in gray-code order (Q2037975): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-030-59901-0_11 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W3090135189 / rank | |||
Normal rank | |||
Latest revision as of 21:11, 19 March 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
