Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The Directed Planar Reachability Problem Eric Allender1
 

Summary: The Directed Planar Reachability Problem
Eric Allender1
, Samir Datta2
, and Sambuddha Roy3
1
Department of Computer Science, Rutgers University, Piscataway, NJ 08855,
allender@cs.rutgers.edu
2
Chennai Mathematical Institute, Chennai, TN 600 017, India sdatta@cmi.ac.in
3
Department of Computer Science, Rutgers University, Piscataway, NJ 08855,
samroy@paul.rutgers.edu
Abstract. We investigate the s-t-connectivity problem for directed planar graphs,
which is hard for L and is contained in NL but is not known to be complete. We
show that this problem is logspace-reducible to its complement, and we show that
the problem of searching graphs of genus 1 reduces to the planar case.
We also consider a previously-studied subclass of planar graphs known as grid
graphs. We show that the directed planar s-t-connectivity problem reduces to the
reachability problem for directed grid graphs.
A special case of the grid-graph reachability problem where no edges are directed

  

Source: Allender, Eric - Department of Computer Science, Rutgers University

 

Collections: Computer Technologies and Information Sciences