Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
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
Lixi Zhou, Jiaqing Chen, et al.
VLDB
Robert C. Durbeck
IEEE TACON
Yao Qi, Raja Das, et al.
ISSTA 2009