Grid Graph Reachability Problems

13 years 8 months ago

Download www.cs.rutgers.edu

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:

Eric Allender, David A. Mix Barrington, Tanmoy Cha

Real-time Traffic

Algorithms | COCO 2006 | Grid Graphs | Planar Graphs | Reachability |

claim paper

» A Uniform Framework for AdHoc Indexes to Answer Reachability Queries on Large Graphs

» Directed Planar Reachability is in Unambiguous LogSpace

» The Reachability Problem over Infinite Graphs

» An Efficient Algorithm for Solving the DyckCFL Reachability Problem on Trees

» When Is Reachability Intrinsically Decidable

» Hamiltonian Cycles in Triangular Grids

» A LogSpace Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources

» Reachability Problems on Regular Ground Tree Rewriting Graphs

Post Info
More Details (n/a)

Added	20 Aug 2010
Updated	20 Aug 2010
Type	Conference
Year	2006
Where	COCO
Authors	Eric Allender, David A. Mix Barrington, Tanmoy Chakraborty, Samir Datta, Sambuddha Roy

Comments (0)

Sciweavers

Grid Graph Reachability Problems

Algorithms | COCO 2006 | Grid Graphs | Planar Graphs | Reachability |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers