Charles H. Bennett, Aram W. Harrow, et al.
IEEE Trans. Inf. Theory
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
Qing Li, Zhigang Deng, et al.
IEEE T-MI
Xinyi Su, Guangyu He, et al.
Dianli Xitong Zidonghua/Automation of Electric Power Systems
Daniel M. Bikel, Vittorio Castelli
ACL 2008