Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case

Directed reachability (or briefly reachability) is the following decision problem: given a directed graph G and two of its vertices s,t, determine whether there is a directed path from s to t in G. Directed reachability is a standard complete problem for the complexity class NL. Planar reachability is an important restricted version of the reachability problem, where the input graph is planar. Planar reachability is hard for L and is contained in NL but is not known to be NL-complete or contained in L. Allender et al. [2009] showed that reachability for graphs embedded on the torus is logspace-reducible to the planar case. We generalize this result to graphs embedded on a fixed surface of arbitrary genus.

[1]  KynčlJan,et al.  Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case , 2010 .

[2]  Thomas Thierauf,et al.  Reachability in K3, 3-Free Graphs and K5-Free Graphs Is in Unambiguous Log-Space , 2009, FCT.

[3]  Raghunath Tewari,et al.  Directed Planar Reachability is in Unambiguous Log-Space , 2007, Twenty-Second Annual IEEE Conference on Computational Complexity (CCC'07).

[4]  Meena Mahajan,et al.  The complexity of planarity testing , 2004, Inf. Comput..

[5]  Eric Allender,et al.  Planar and Grid Graph Reachability Problems , 2009, Theory of Computing Systems.

[6]  Meena Mahajan,et al.  The complexity of planarity testing , 2000, Inf. Comput..

[7]  Noam Nisan,et al.  Symmetric logspace is closed under complement , 1995, STOC '95.

[8]  Omer Reingold,et al.  Undirected connectivity in log-space , 2008, JACM.

[9]  Derrick Stolee,et al.  A log-space algorithm for reachability in planar DAGs with few sources , 2009, Electron. Colloquium Comput. Complex..

[10]  Carsten Thomassen,et al.  Graphs on Surfaces , 2001, Johns Hopkins series in the mathematical sciences.

[11]  Derrick Stolee,et al.  A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

[12]  Andreas Jakoby,et al.  Space efficient algorithms for directed series-parallel graphs , 2006, J. Algorithms.