Time-space tradeoffs for undirected graph traversal by graph automata
From MaRDI portal
Publication:675049
DOI10.1006/inco.1996.0085zbMath0872.68067WikidataQ57904581 ScholiaQ57904581MaRDI QIDQ675049
Prabhakar Raghavan, Allan Borodin, Walter L. Ruzzo, Martin Tompa, P. W. Beame
Publication date: 13 October 1997
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/a56abd0944bf5cc19d3c8e56a60509c89063101e
68Q25: Analysis of algorithms and problem complexity
68R10: Graph theory (including graph drawing) in computer science
Related Items
Undirected \(s\)--\(t\) connectivity in polynomial time and sublinear space, A spectrum of time-space trade-offs for undirected \(s-t\) connectivity