Cited By
View all- Leiss E(2013)The worst Hanoi graphsTheoretical Computer Science10.1016/j.tcs.2013.05.020498(100-106)Online publication date: 1-Aug-2013
It is known that in the Tower of Hanoi graphs there are at most two different shortest paths between any fixed pair of vertices. A formula is given that counts, for a given vertex v, the number of vertices u such that there are two shortest u, v-paths. ...
We study the Bottleneck Tower of Hanoi puzzle posed by D. Wood in 1981. There, a relaxed placement rule allows a larger disk to be placed higher than a smaller one if their size difference is less than a pregiven value k. A shortest sequence of moves (...
Connectivity properties are very important characteristics of a graph. Whereas it is usually referred to as a measure of a graph's vulnerability, a relatively new approach discusses a graph's average connectivity as a measure for the graph's performance ...
Association for Computing Machinery
New York, NY, United States
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in