David S. Kung
DAC 1998
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
A. Gupta, R. Gross, et al.
SPIE Advances in Semiconductors and Superconductors 1990
Reena Elangovan, Shubham Jain, et al.
ACM TODAES
Liat Ein-Dor, Y. Goldschmidt, et al.
IBM J. Res. Dev