By Topic

A randomized time-space tradeoff of O˜(mRˆ) for USTCON

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Feige, U. ; Dept. of Appl. Math., Weizmann Inst. of Sci., Rehovot, Israel

We present a randomized time space tradeoff of O˜(mRˆ) for undirected S-T-connectivity, where Rˆ ΣυεV 1/dυ is the virtual resistance of the graph. This solves an open question of Broder et al. (1989) (implicit also in Aleliunas et al. (1979)) who asked whether a tradeoff of O˜(mn) is achievable, and also improves upon a tradeoff of O˜(mn/dmin) conjectured by Barnes and Feige (1993). Our algorithm is a modification of the Broder et al. algorithm. In passing, we also improve a result from Barnes and Feige regarding the rate at which a random walk discovers new vertices in a graph

Published in:

Foundations of Computer Science, 1993. Proceedings., 34th Annual Symposium on

Date of Conference:

3-5 Nov 1993