Advertisement

Planar k-Path in Subexponential Time and Polynomial Space

  • Daniel Lokshtanov
  • Matthias Mnich
  • Saket Saurabh
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6986)

Abstract

In the k-Path problem we are given an n-vertex graph G together with an integer k and asked whether G contains a path of length k as a subgraph. We give the first subexponential time, polynomial space parameterized algorithm for k-Path on planar graphs, and more generally, on H-minor-free graphs. The running time of our algorithm is \(O(2^{O(\sqrt{k}\log^2 k)}n^{O(1)})\).

Keywords

Planar Graph Parameterized Algorithm Polynomial Kernel Tree Decomposition Solution Path 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Alber, J., Fernau, H., Niedermeier, R.: Graph separators: a parameterized view. J. Comput. System Sci. 67(4), 808–832 (2003); Special issue on parameterized computation and complexityMathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. System Sci. 75(8), 423–434 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  3. 3.
    Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (Meta) Kernelization. In: Proc. 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 629–638. IEEE Computer Society (2009)Google Scholar
  4. 4.
    Demaine, E.D., Fomin, F.V., Hajiaghayi, M., Thilikos, D.M.: Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs. J. ACM 52(6), 866–893 (electronic), (2005)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Demaine, E.D., Hajiaghayi, M.: The bidimensionality theory and its algorithmic applications. Comput. J. 51(3), 292–302 (2008)CrossRefGoogle Scholar
  6. 6.
    Diestel, R., Jensen, T.R., Gorbunov, K.Y., Thomassen, C.: Highly connected sets and the excluded grid theorem. J. Comb. Theory, Ser. B 75(1), 61–73 (1999)MathSciNetCrossRefzbMATHGoogle Scholar
  7. 7.
    Dorn, F., Fomin, F.V., Thilikos, D.M.: Catalan structures and dynamic programming in H-minor-free graphs. In: Proc. 19th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 631–640. ACMGoogle Scholar
  8. 8.
    Dorn, F., Fomin, F.V., Thilikos, D.M.: Subexponential parameterized algorithms. Computer Science Review 2(1), 29–39 (2008)CrossRefzbMATHGoogle Scholar
  9. 9.
    Dorn, F., Penninkx, E., Bodlaender, H.L., Fomin, F.V.: Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Branch Decompositions. In: Brodal, G.S., Leonardi, S. (eds.) ESA 2005. LNCS, vol. 3669, pp. 95–106. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  10. 10.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, HeidelbergGoogle Scholar
  11. 11.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, HeidelbergGoogle Scholar
  12. 12.
    Fomin, F.V., Grandoni, F., Kratsch, D.: Faster Steiner Tree Computation in Polynomial-Space. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol. 5193, pp. 430–441. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  13. 13.
    Fomin, F.V., Lokshtanov, D., Raman, V., Saurabh, S.: Subexponential algorithms for partial cover problems. In: IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Leibniz International Proc. Informatics, vol. 4, pp. 193–201. Schloss Dagstuhl–Leibniz-Zentrum für Informatik (2009)Google Scholar
  14. 14.
    Fomin, F.V., Lokshtanov, D., Saurabh, S., Thilikos, D.M.: Bidimensionality and kernels. In: Proc. 21st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 503–510. Society for Industrial and Applied Mathematics (2010)Google Scholar
  15. 15.
    Garey, M.R., Johnson, D.S., Tarjan, R.E.: The planar hamiltonian circuit problem is np-complete. SIAM J. Comput. 5(4), 704–714 (1976)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Karp, R.M.: Reducibility among combinatorial problems. Complexity of Computer Computations, 85–103 (1972)Google Scholar
  17. 17.
    Kloks, T.: Treewidth. Computations and Approximations. LNCS, vol. 842. Springer, Heidelberg (1994)zbMATHGoogle Scholar
  18. 18.
    Lipton, R.J., Tarjan, R.E.: A separator theorem for planar graphs. SIAM J. Appl. Math. 36(2), 177–189 (1979)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput. 9(3), 615–627 (1980)MathSciNetCrossRefzbMATHGoogle Scholar
  20. 20.
    Lokshtanov, D., Nederlof, J.: Saving space by algebraization. In: STOC, pp. 321–330 (2010)Google Scholar
  21. 21.
    Nederlof, J.: Fast Polynomial-Space Algorithms Using Möbius Inversion: Improving on Steiner Tree and Related Problems. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 713–725. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  22. 22.
    Niedermeier, R.: Invitation to Fixed-parameter Algorithms, Oxford Lecture Series in Mathematics and its Applications, vol. 31. Oxford University Press (2006)Google Scholar
  23. 23.
    Reed, B.A.: Tree width and tangles: a new connectivity measure and some applications. In: Surveys in Combinatorics, 1997, London. London Math. Soc. Lecture Note Ser, vol. 241, pp. 87–162. Cambridge Univ. Press (1997)Google Scholar
  24. 24.
    Woeginger, G.J.: Space and Time Complexity of Exact Algorithms: Some Open Problems. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 281–290. Springer, Heidelberg (2004)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Daniel Lokshtanov
    • 1
  • Matthias Mnich
    • 2
  • Saket Saurabh
    • 3
  1. 1.University of CaliforniaSan DiegoUSA
  2. 2.International Computer Science InstituteBerkeleyUSA
  3. 3.The Institute of Mathematical SciencesChennaiIndia

Personalised recommendations