The tower of Hanoi problem on Path\(_h\) graphs (Q427887): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
m rollbackEdits.php mass rollback Tag: Rollback |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2012.02.007 / rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1904087561 / rank | |||
Revision as of 16:02, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The tower of Hanoi problem on Path\(_h\) graphs |
scientific article |
Statements
The tower of Hanoi problem on Path\(_h\) graphs (English)
0 references
18 June 2012
0 references
tower of Hanoi
0 references
path graphs
0 references
analysis of algorithms
0 references
subexponential growth rate
0 references
