A note on parallelism for the towers of Hanoi
From MaRDI portal
Publication:1336867
DOI10.1016/0895-7177(94)90028-0zbMath0822.68072OpenAlexW1983238633MaRDI QIDQ1336867
Publication date: 6 November 1994
Published in: Mathematical and Computer Modelling (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0895-7177(94)90028-0
Combinatorics in computer science (68R05) Graph theory (including graph drawing) in computer science (68R10)
Related Items (2)
Parallelism for multipeg towers of Hanoi ⋮ Nonrecursive solution to parallel multipeg towers of Hanoi: A decomposition approach
Cites Work
- The Towers of Hanoi Problem
- The cyclic towers of Hanoi
- The towers of Hanoi revisited: Moving the rings by counting the moves
- The towers of Hanoi problem with parallel moves
- Towers of hanoi graphs
- A Representation Approach to the Tower of Hanoi Problem
- Discussion and correspondence: A note on the Towers of Hanoi problem
This page was built for publication: A note on parallelism for the towers of Hanoi