Showing cs.DMShow all
2 papers · 1 filter
cs.DM2009
A Measure of the Connection Strengths between Graph Vertices with Applications
Jie Chen, Ilya Safro
We present a simple iterative strategy for measuring the connection strength between a pair of vertices in a graph. The method is attractive in that it has a linear complexity and…
cs.DM2006
Generalizations of the Hanoi Towers Problem
Sergey Benditkis, Illya Safro
Our theme bases on the classical Hanoi Towers Problem. In this paper we will define a new problem, permitting some positions, that were not legal in the classical problem. Our goal…