Abstract
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.
- Agrawal, M. 2007. Rings and integer lattices in computer science. In Proceedings of Babados Workshop on Computational Complexity. Lecture 9.Google Scholar
- Allender, E., Reinhardt, K., and Zhou, S. 1999. Isolation, matching, and counting: Uniform and nonuniform upper bounds. J. Comput. Syst. Sci. 59, 2, 164--181. Google Scholar
Digital Library
- Allender, E., Datta, S., and Roy, S. 2005. The directed planar reachability problems. In Proceedings of Foundations of Software Technology and Theoretical Computer Science. 238--249. Google Scholar
Digital Library
- Allender, E., Barrington, D., Chakraborty, T., Datta, S., and S., R. 2006. Grid graph reachability problems. In Proceedings of the IEEE Conference on Computational Complexity. IEEE, 299--313. Google Scholar
Digital Library
- Bourke, C., Tewari, R., and Vinodchandran, N. 2009. Directed planar reachability is in unambiguous log-space. Trans. Comput. Theory 1, 1. Google Scholar
Digital Library
- Datta, S., Kulkarni, R., Limaye, N., and Mahajan, M. 2010a. Planarity, determinants, permanents, and (unique) matchings. Trans. Comput. Theory 1, 3. Google Scholar
Digital Library
- Datta, S., Kulkarni, R., and Roy, S. 2010b. Deterministically isolating a perfect matching in bipartite planar graphs. Theory Comput. Syst. 47, 3, 737--757. Google Scholar
Digital Library
- Gál, A. and Wigderson, A. 1996. Boolean complexity classes vs. their arithmetic analogs. Random Struct. Algor. 9, 1--2, 99--111. Google Scholar
Digital Library
- Garey, M., Johnson, D., and Tarjan, R. 1968. The plane hamiltonian problem is np-complete. SIAM J. Comput. 5, 704--714.Google Scholar
Cross Ref
- Kasteleyn, P. 2011. Graph theory and crystal physics. In Graph Theory and Theoretical Physics. Academic Press, New York, 43--110.Google Scholar
- Limaye, N., Mahajan, M., and Nimbhorkar, P. 2008. Longest paths in planar dags in unambiguous log-space. CoRR abs/0802.1699: (2008).Google Scholar
- Mahajan, M. and Varadarajan, K. 2000. A new nc algorithm to find a perfect matching in planar and bounded genus graphs. In Proceedings of the 32nd Annual ACM Symposium on Theory of Computing (STOC). 351--357. Google Scholar
Digital Library
- Miller, G. and Naor, J. 1995. Flow in planar graphs with multiple sources and sinks. SIAM J. Comput. 24, 1002--1017. Google Scholar
Digital Library
- Mulmuley, K., Vazirani, U., and Vazirani, V. 1987. Matching is as easy as matrix inversion. Combinatorica 7, 1, 105--131. Google Scholar
Digital Library
- Tewari, R. and Vinodchandran, N. 2010. Green’s theorem and isolation in planar graphs. Tech. rep. ECCC.Google Scholar
- Valiant, L. and Vazirani, V. 1986. Np is as easy as detecting unique solutions. Theor. Comput. Sci. 47, 3, 85--93. Google Scholar
Digital Library
- Vollmer, H. 1999. Introduction to Circuit Complexity - A Uniform Approach : Texts in Theoretical Computer Science. Springer. Google Scholar
Digital Library
- Vornberger, O. 1981. Alternating cycle covers and paths. Lecture Notes in Computer Science. vol. 100.Google Scholar
Index Terms
On the Power of Isolation in Planar Graphs
Recommendations
Total domination in planar graphs of diameter two
MacGillivary and Seyffarth [G. MacGillivray, K. Seyffarth, Domination numbers of planar graphs, J. Graph Theory 22 (1996) 213-229] proved that planar graphs of diameter two have domination number at most three. Goddard and Henning [W. Goddard, M.A. ...
Adapted list coloring of planar graphs
Given an edge coloring F of a graph G, a vertex coloring of G is adapted to F if no color appears at the same time on an edge and on its two endpoints. If for some integer k, a graph G is such that given any list assignment L to the vertices of G, with |...
Planar graphs without 4- and 5-cycles are acyclically 4-choosable
Let G=(V,E) be a graph. A proper vertex coloring of G is acyclic if G contains no bicolored cycle. Namely, every cycle of G must be colored with at least three colors. G is acyclically L-list colorable if for a given list assignment L={L(v):v@?V}, there ...






Comments