Publication:4449241
From MaRDI portal
zbMath1040.60037MaRDI QIDQ4449241
Izumi Kubo, Norihiro Okumoto, Satoshi Ikeda, Masafumi Yamashita
Publication date: 8 February 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2719/27191054.htm
Related Items
Memory Efficient Anonymous Graph Exploration, Geometric bounds for convergence rates of averaging algorithms, Reversible random walks on dynamic graphs, Hitting times for random walks on subdivision and triangulation graphs, The hitting and cover times of Metropolis walks, Tight bounds for the cover time of multiple random walks, The hitting and cover times of random walks on finite graphs using local degree information, How to Design a Linear Cover Time Random Walk on a Finite Graph, A Fast Algorithm to Find All High-Degree Vertices in Graphs with a Power-Law Degree Sequence