Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
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
Yao Qi, Raja Das, et al.
ISSTA 2009
Leo Liberti, James Ostrowski
Journal of Global Optimization
Qing Li, Zhigang Deng, et al.
IEEE T-MI