Yao Qi, Raja Das, et al.
ISSTA 2009
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
Khaled A.S. Abdel-Ghaffar
IEEE Trans. Inf. Theory
Raymond F. Boyce, Donald D. Chamberlin, et al.
CACM
Khalid Abdulla, Andrew Wirth, et al.
ICIAfS 2014