G. Barnes and W. L. Ruzzo. Undirected s-t connectivity in polynomial time and sublinear space. Comput. Complexity, 6(1):1--28, 1996/97. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Traversal of a Quasi-Planar Subdivision without.. - Chavez, Dobrev.. (2004) (Correct)
No context found.
G. Barnes and W. L. Ruzzo. Undirected s-t connectivity in polynomial time and sublinear space. Comput. Complexity, 6(1):1--28, 1996/97.
A Compendium of Problems Complete for Symmetric Logarithmic.. - Alvarez, Greenlaw (1996) (7 citations) (Correct)
No context found.
Greg Barnes and Walter L. Ruzzo, Undirected s-t connectivity in polynomial time and sublinear space. Computational Complexity 1(6) (1997), 1--28.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC