Grid Graph Reachability Problems

We study the complexity of restricted versions of s-t-connectivity, which is the standard complete problem for NL. In particular, we focus on different classes of planar graphs, of which grid graphs are an important special case. Our main results are:

• Type: Conference
• Year: 2006
• Where: COCO
• Authors: Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy
• Keywords: Algorithms, COCO 2006, Grid Graphs, Planar Graphs, Reachability