N. Alon, Paul Seymour, et al.
STOC 1990
Conference paper
Random walks on weighted graphs, and applications to on-line algorithms.
Abstract
We study the design and analysis of randomized on-line algorithms. We show that this problem is closely related to the synthesis of random walks on graphs with positive real costs on their edges.
Related
Conference paper
Web as a graph
R. Kumar, Prabhakar Raghavan, et al.
SIGMOD/PODS/ 2000
G. Bongiovanni, D. Coppersmith, et al.
IEEE Transactions on Communications
Soumen Chakrabarti, B. Dom, et al.
Scientific American