Time-space tradeoffs for undirected graph traversal (1990)
Cached
Download Links
- [csdl.computer.org]
- [128.95.4.112]
- [www.cs.washington.edu]
- [www.cs.washington.edu]
- [ftp.cs.washington.edu]
- [www.cs.washington.edu]
- [www.cs.washington.edu]
- DBLP
Other Repositories/Bibliography
by
Paul Beame
,
Allan Borodin
,
Prabhakar Raghavan
,
Walter L. Ruzzo
,
Martin Tompa
| Citations: | 7 - 1 self |
BibTeX
@MISC{Beame90time-spacetradeoffs,
author = {Paul Beame and Allan Borodin and Prabhakar Raghavan and Walter L. Ruzzo and Martin Tompa},
title = {Time-space tradeoffs for undirected graph traversal},
year = {1990}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
We prove time-space tradeoffs for traversing undi-rected graphs. One of these is a quadratic lower bound on a deterministic model that closely matches the recent probabilistic upper bound of Broder, Karlin, Raghavan, and Upfal. The models used are variants of Cook and Rackoff’s “Jumping Automata for Graphs".
