Tight bounds for rumor spreading in graphs of a given conductance
the shortest - path problem for graphs with random arc - lengths .