Quinn Pham, Danila Seliayeu, et al.
CASCON 2024
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
Yvonne Anne Pignolet, Stefan Schmid, et al.
Discrete Mathematics and Theoretical Computer Science
Rolf Clauberg
IBM J. Res. Dev
Kaoutar El Maghraoui, Gokul Kandiraju, et al.
WOSP/SIPEW 2010