The number of moves of the largest disc in shortest paths on Hanoi graphs
From MaRDI portal
Publication:490248
zbMATH Open1305.05059MaRDI QIDQ490248FDOQ490248
Authors: Simon Aumann, Katharina A. M. Götz, Andreas M. Hinz, Ciril Petr 
Publication date: 22 January 2015
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i4p38
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Cites Work
- Introduction to algorithms.
- Metric properties of the Tower of Hanoi graphs and Stern's diatomic sequence
- The average eccentricity of Sierpiński graphs
- The Tower of Hanoi – Myths and Maths
- Graphs S(n, k) and a Variant of the Tower of Hanoi Problem
- Shortest Paths in the Tower of Hanoi Graph and Finite Automata
- Title not available (Why is that?)
- On the Frame-Stewart algorithm for the multi-peg Tower of Hanoi problem
- An efficient algorithm to determine all shortest paths in Sierpiński graphs
- Title not available (Why is that?)
- The tower of Hanoi
- The Group of Symmetries of the Tower of Hanoi Graph
- Coloring Hanoi and Sierpiński graphs
- Towers of hanoi graphs
- Adjudicating a towers of hanoi contest†
Cited In (6)
- A survey and classification of Sierpiński-type graphs
- Open problems for Hanoi and Sierpiński graphs
- A new lower bound for the Towers of Hanoi problem
- Computational solution of an old tower of Hanoi problem
- An efficient algorithm to determine all shortest paths in Sierpiński graphs
- Title not available (Why is that?)
This page was built for publication: The number of moves of the largest disc in shortest paths on Hanoi graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q490248)
