Abstract
We initiate the study of space complexity of certain optimization problems restricted to planar graphs. We provide upper bounds and hardness results in space complexity for some of these well-studied problems in the context of planar graphs. In particular we show the following:
1. Max-Cut in planar graphs has a (UL∩co – UL)-approximation scheme;
2. Sparsest-Cut in planar graphs is in NL;
3. Max-Cut in planar graphs is NL-hard;
4. ⊕Directed-Spanning-Trees in planar graphs is ⊕L-complete.
For (1) we analyze the space complexity of the well known Baker’s algorithm [1] using a recent result of Elberfeld, Jakoby, and Tantau [13] that gives a Log-space analogue of Courcelle’s Theorem for MSO definable properties of bounded tree-width graphs.
For (2) we analyze the space complexity of the algorithm of Patel [21] that builds on a useful weighting scheme for planar graphs. Interestingly, the same weighting scheme has been crucially used in the totally different context of isolation in planar graphs [4,7].
For (3) we use a recent result of Kulkarni [17], which shows that Minwt-PM in planar graphs is NL-hard.
For (4) we use the result by Datta, Kulkarni, Limaye, and Mahajan [8] that gives a reduction from the permanent in general graphs to planar graphs.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153–180 (1994)
Bampis, E., Giannakos, A., Karzonov, A., Manoussakis, Y., Milis, I.: Perfect matching in general vs. cubic graphs: A note on the planar and bipartite cases. Theoretical Computer Science and Applications 34(2), 87–97 (2000)
Blum, M., Kozen, D.: On the power of the compass (or why mazes are easier to search than graphs). In: FOCS, pp. 132–142 (1978)
Bourke, C., Tewari, R., Vinodchandran, N.V.: Directed planar reachability is in unambiguous log-space. TOCT 1(1) (2009)
Braverman, M., Kulkarni, R., Roy, S.: Space-efficient counting in graphs on surfaces. Computational Complexity 18(4), 601–649 (2009)
Courcelle, B.: The monadic second-order logic of graphs. I Recognizable Sets of Finite Graphs. Inf. Comput. 85(1), 12–75 (1990)
Datta, S., Gopalan, A., Kulkarni, R., Tewari, R.: Improved bounds for bipartite matching on surfaces. In: STACS, pp. 254–265 (2012)
Datta, S., Kulkarni, R., Limaye, N., Mahajan, M.: Planarity, determinants, permanents, and (unique) matchings. TOCT 1(3) (2010)
Datta, S., Kulkarni, R., Roy, S.: Deterministically isolating a perfect matching in bipartite planar graphs. Theory Comput. Syst. 47(3), 737–757 (2010)
Datta, S., Kulkarni, R., Tewari, R., Vinodchandran, N.V.: Space complexity of perfect matching in bounded genus bipartite graphs. J. Comput. Syst. Sci. 78(3), 765–779 (2012)
Datta, S., Limaye, N., Nimbhorkar, P., Thierauf, T., Wagner, F.: Planar graph isomorphism is in log-space. In: IEEE Conference on Computational Complexity, pp. 203–214 (2009)
Diestel, R.: Graph Theory (Graduate Texts in Mathematics). Springer (August 2005)
Elberfeld, M., Jakoby, A., Tantau, T.: Logspace versions of the theorems of bodlaender and courcelle. In: FOCS, pp. 143–152 (2010)
Eppstein, D.: Diameter and treewidth in minor-closed graph families. Algorithmica 27(3), 275–291 (2000)
Hadlock, F.: Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. 4(3), 221–225 (1975)
Harris, J.M., Hirst, J.L., Mossinghoff, M.J.: Graph Theory (Undergraduate Texts in Mathematics). Springer (September 19, 2008)
Kulkarni, R.: On the power of isolation in planar graphs. TOCT 3(1), 2 (2011)
Limaye, N., Mahajan, M., Sarma, J.M.N.: Upper bounds for monotone planar circuit value and variants. Computational Complexity 18(3), 377–412 (2009)
Mahajan, M., Varadarajan, K.R.: A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs. In: STOC, pp. 351–357 (2000)
Miller, G.L., Naor, J.: Flow in planar graphs with multiple sources and sinks. SIAM J. Comput. 24(5), 1002–1017 (1995)
Patel, V.: Determining edge expansion and other connectivity measures of graphs of bounded genus. In: de Berg, M., Meyer, U. (eds.) ESA 2010, Part I. LNCS, vol. 6346, pp. 561–572. Springer, Heidelberg (2010)
Reingold, O.: Undirected connectivity in log-space. J. ACM 55(4), 1–24 (2008)
Tantau, T.: Logspace optimization problems and their approximability properties. Theory Comput. Syst. 41(2), 327–350 (2007)
Thierauf, T., Wagner, F.: The isomorphism problem for planar 3-connected graphs is in unambiguous logspace. Theory Comput. Syst. 47(3), 655–673 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this paper
Cite this paper
Datta, S., Kulkarni, R. (2014). Space Complexity of Optimization Problems in Planar Graphs. In: Gopal, T.V., Agrawal, M., Li, A., Cooper, S.B. (eds) Theory and Applications of Models of Computation. TAMC 2014. Lecture Notes in Computer Science, vol 8402. Springer, Cham. https://doi.org/10.1007/978-3-319-06089-7_21
Download citation
DOI: https://doi.org/10.1007/978-3-319-06089-7_21
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-06088-0
Online ISBN: 978-3-319-06089-7
eBook Packages: Computer ScienceComputer Science (R0)