Uriel Feige  Home/Search
Context
Related
| wisdom.weizmann.ac.il/~fe...spectrum.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: wisdom.weizmann.ac.i...randomwalk (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We present a family of randomized algorithms that enjoys a wide range of time-space tradeoffs in deciding undirected S-T -connectivity. Our tradeoffs cover the whole range between Breadth First Search and the random walk procedure of Aleliunas et al., and achieve a time-space product of ~ O(mn) (where n is the number of vertices in the graph, m is the number of edges, and ~ O notation is used in order to suppress logarithmic terms). Moreover, we obtain improved time-space tradeoffs of ~... (Update)
Active bibliography (related documents): More All
0.4: Time-Space Tradeoffs for Undirected Graph.. - Beame, Borodin.. (1997) (Correct)
0.3: A Time-Space Tradeoff for Undirected Graph.. - Beame, Borodin.. (1997) (Correct)
0.2: A Tight Lower Bound on the Cover Time for Random Walks on Graphs - Feige (1994) (Correct)
Similar documents based on text: More All
0.3: Realizations Of Causal Manifolds By Quantum Fields - Saller (1997) (Correct)
0.3: Sampling Vertex Degrees and Estimating Network Load Parameters - Feige (2003) (Correct)
0.3: OwnTime: A System for Timespace Management - Rodenstein, Abowd, Catrambone (1999) (Correct)
BibTeX entry: (Update)
@article{ feige97spectrum,
author = "Uriel Feige",
title = "A Spectrum of Time-Space Trade-Offs for Undirected s-t Connectivity",
journal = "Journal of Computer and System Sciences",
volume = "54",
number = "2",
pages = "305-316",
year = "1997",
url = "citeseer.ist.psu.edu/feige96spectrum.html" }
Citations (may not include all citations):113 Reversible markov chains and random walks on graphs (context) - Aldous - 1993
68 The electrical resistance of a graph captures its commute an.. - Chandra, Raghavan et al. - 1989 ACM DBLP
48 Two applications of inductive counting for complementation p.. (context) - Borodin, Cook et al. - 1989
33 Random Walks and Electrical Networks (context) - Doyle, Snell - 1984
24 Random walks and the effective resistance of networks (context) - Tetali - 1991
20 Random walks, universal traversal sequences, and the complex.. (context) - Aleliunas, Karp et al. - 1979 DBLP
20 the cover time of random walks on graphs (context) - Kahn, Linial et al. - 1989
14 Trading space for time in undirected s-t connectivity - Broder, Karlin et al. - 1994
11 Random walks on regular and irregular graphs - Coppersmith, Feige et al. - 1993 ACM DBLP
11 Time-Space Tradeoffs For Undirected ST-Connectivity on a JAG (context) - Edmonds - 1993
10 Time-space tradeoffs for undirected graph traversal - Beame, Borodin et al. - 1990
5 A fast randomized logspace algorithm for graph connectivity - Feige
1 Lecture Notes for CS (context) - Ruzzo - 1989
Documents on the same site (http://www.wisdom.weizmann.ac.il/~feige/randomwalk.html): More
Collecting Coupons On Trees, And The Cover Time Of Random Walks - Feige (Correct)
Short Random Walks On Graphs - Barnes, Feige (1993) (Correct)
A Tight Upper Bound on the Cover Time for Random Walks on Graphs - Feige (1995) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC