On the Power of Isolation in Planar Graphs

We study (deterministic) isolation for certain structures in directed and undirected planar graphs. The motivation for undertaking such a study comes from recent positive results on this topic. For example: Bourke et al. [2009] isolate a directed path in planar graphs and subsequently Datta et al. [2010b] isolate a perfect matching in bipartite planar graphs. Our first observation is that sufficiently strong (and plausible) isolations for certain structures in planar graphs would have strong consequences such as: NL ⊆ ⊕L, Bipartite-Matching ∈ NC, and NP ⊆ ⊕P. Our second observation is that although we do not yet have such strong isolations for arbitrary planar graphs, we do have them for bipartite planar graphs, that is, non-bipartiteness is the main bottleneck.

[1]  Eric Allender,et al.  Grid graph reachability problems , 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06).

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

[3]  Eric Allender,et al.  Isolation, matching, and counting , 1998, Proceedings. Thirteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat. No.98CB36247).

[4]  Leslie G. Valiant,et al.  NP is as easy as detecting unique solutions , 1985, STOC '85.

[5]  Oliver Vornberger,et al.  Alternative Cycle Covers and Paths , 1980, WG.

[6]  Avi Wigderson,et al.  Boolean complexity classes vs. their arithmetic analogs , 1996 .

[7]  Raghav Kulkarni,et al.  Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs , 2009, Theory of Computing Systems.

[8]  Meena Mahajan,et al.  Longest Paths in Planar DAGs in Unambiguous Log-Space , 2010, Chic. J. Theor. Comput. Sci..

[9]  Meena Mahajan,et al.  A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract) , 2000, STOC '00.

[10]  Meena Mahajan,et al.  Planarity, Determinants, Permanents, and (Unique) Matchings , 2010, TOCT.

[11]  Avi Wigderson,et al.  Boolean complexity classes vs. their arithmetic analogs , 1996, Random Struct. Algorithms.

[12]  Eric Allender,et al.  Isolation, Matching, and Counting Uniform and Nonuniform Upper Bounds , 1999, J. Comput. Syst. Sci..

[13]  Eric Allender,et al.  The Directed Planar Reachability Problem , 2005, FSTTCS.

[14]  David S. Johnson,et al.  The Planar Hamiltonian Circuit Problem is NP-Complete , 1976, SIAM J. Comput..

[15]  Raghunath Tewari,et al.  Green's theorem and isolation in planar graphs , 2012, Inf. Comput..

[16]  Gary L. Miller,et al.  Flow in Planar Graphs with Multiple Sources and Sinks , 1995, SIAM J. Comput..

[17]  Vijay V. Vazirani,et al.  Matching is as easy as matrix inversion , 1987, STOC.

[18]  Heribert Vollmer,et al.  Introduction to Circuit Complexity: A Uniform Approach , 2010 .