loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
21st Annual IEEE Conference on Computational Complexity (CCC'06)
Grid Graph Reachability Problems
Prague, Czech Republic
July 16-July 20
ISBN: 0-7695-2596-2
ASCII Text
x 
 
Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy, "Grid Graph Reachability Problems," Computational Complexity, Annual IEEE Conference on, pp. 299-313, 21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/CCC.2006.22,
author = {Eric Allender and David A. Mix Barrington and Tanmoy Chakraborty and Samir Datta and Sambuddha Roy},
title = {Grid Graph Reachability Problems},
journal ={Computational Complexity, Annual IEEE Conference on},
volume = {0},
year = {2006},
issn = {1093-0159},
pages = {299-313},
doi = {http://doi.ieeecomputersociety.org/10.1109/CCC.2006.22},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computational Complexity, Annual IEEE Conference on
TI - Grid Graph Reachability Problems
SN - 1093-0159
SP299
EP313
A1 - Eric Allender,
A1 - David A. Mix Barrington,
A1 - Tanmoy Chakraborty,
A1 - Samir Datta,
A1 - Sambuddha Roy,
PY - 2006
KW - null
VL - 0
JA - Computational Complexity, Annual IEEE Conference on
ER -
 
Eric Allender, Rutgers University, USA
David A. Mix Barrington, University of Massachusetts Amherst, USA
Tanmoy Chakraborty, Chennai Mathematical Institute, India
Samir Datta, Chennai Mathematical Institute, India
Sambuddha Roy, Rutgers University, USA
We study the complexity of reachability problems on various classes of grid graphs. Reachability on certain classes of grid graphs gives natural examples of problems that are hard for NC^1 under AC^0 reductions but are not known to be hard for L; they thus give insight into the structure of L.

In addition to explicating the structure of L, another of our goals is to expand the class of digraphs for which connectivity can be solved in logspace, by building on the work of Jakoby et al. [14], who showed that reachability in series-parallel digraphs is solvable in L. We show that reachability for single-source multiple-sink planar dags is solvable in L.

Citation:
Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy, "Grid Graph Reachability Problems," ccc, pp.299-313, 21st Annual IEEE Conference on Computational Complexity (CCC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.