Beomseok Nam, Henrique Andrade, et al.
ACM/IEEE SC 2006
Paper
A time-space tradeoff for undirected graph traversal by walking automata
Abstract
We prove a time-space tradeoff for traversing undirected graphs, using a structured model that is a nonjumping variant of Cook and Rackoff's "jumping automata for graphs.". © 1999 Society for Industrial and Applied Mathematics.
Related
Zohar Feldman, Avishai Mandelbaum
WSC 2010
Indranil R. Bardhan, Sugato Bagchi, et al.
JMIS
Lixi Zhou, Jiaqing Chen, et al.
VLDB