A $\tilde O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity

Details A $\tilde O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity A $\tilde O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity

2012-04-05

arxiv.org/abs/1204.1136v2

Computer Science

Data Structures and Algorithms

Scientific paper

We propose a family of randomized algorithms for undirected s-t-connectivity which achieve a time-space product of $S\cdot T = \tilde O(n^2)$ for a graph with $n$ nodes and $m$ edges (where the $\tilde O$-notation disregards poly-logarithmic terms). In particular, we obtain a log-space algorithm which solves s-t-connectivity faster than the random walk, as well as an algorithm running in time $\O(n+m)$ which is, in general, more space-efficient than BFS or DFS. The algorithms rely on a new Monte-Carlo type walk on graphs, which is then combined with the landmark-based scheme of Broder et al. (1994).

Affiliated with

Also associated with

No associations

Rating

A $\tilde O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with A $\tilde O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A $\tilde O(n^2)$ Time-Space Trade-off for Undirected s-t Connectivity will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-212320