Advertisement

Algorithmica

, Volume 62, Issue 3–4, pp 807–822 | Cite as

Obtaining a Planar Graph by Vertex Deletion

  • Dániel Marx
  • Ildikó Schlotter
Article

Abstract

In the k-Apex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor closed class of graphs, hence by the deep results of Robertson and Seymour (J. Comb. Theory, Ser. B 63(1):65–110, 1995; J. Comb. Theory, Ser. B 92(2):325–357, 2004), there is a cubic algorithm for every fixed value of k. However, the proof is extremely complicated and the constants hidden by the big-O notation are huge. Here we give a much simpler algorithm for this problem with quadratic running time, by iteratively reducing the input graph and then applying techniques for graphs of bounded treewidth.

Keywords

Planar graph Apex graph FPT algorithm Vertex deletion 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Adler, I., Grohe, M., Kreutzer, S.: Computing excluded minors. In: SODA 2008: Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 641–650 (2008) Google Scholar
  2. 2.
    Arnborg, S., Proskurowski, A., Seese, D.: Monadic second order logic, tree automata and forbidden minors. In: CSL 1990: Proceedings of the 4th Workshop on Computer Science Logic. Lecture Notes in Computer Science, vol. 533, pp. 1–16. Springer, Berlin (1991) Google Scholar
  3. 3.
    Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. ACM 41(1), 153–180 (1994) CrossRefzbMATHGoogle Scholar
  4. 4.
    Bodlaender, H.L.: On disjoint cycles. Int. J. Found. Comput. Sci. 5(1), 59–68 (1994) CrossRefzbMATHGoogle Scholar
  5. 5.
    Bodlaender, H.L.: A linear-time algorithm for finding tree-decompositions of small treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996) CrossRefzbMATHMathSciNetGoogle Scholar
  6. 6.
    Bodlaender, H.L.: Treewidth: Algorithmic techniques and results. In: MFCS 1997: Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, vol. 1295, pp. 19–36. Springer, Berlin (1997) CrossRefGoogle Scholar
  7. 7.
    Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171–176 (1996) CrossRefzbMATHGoogle Scholar
  8. 8.
    Chen, J., Liu, Y., Lu, S., O’Sullivan, B., Razgon, I.: A fixed-parameter algorithm for the directed feedback vertex set problem. J. ACM 55(5), 1–19 (2008) CrossRefMathSciNetGoogle Scholar
  9. 9.
    Courcelle, B.: Graph rewriting: An algebraic and logic approach. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics (B), pp. 193–242. Elsevier/MIT Press, Amsterdam/Cambridge (1990) Google Scholar
  10. 10.
    Courcelle, B.: The expression of graph properties and graph transformations in monadic second-order logic. In: Rozenberg, G. (ed.) Handbook of Graph Grammars and Computing by Graph Transformations, Volume 1: Foundations, pp. 313–400. World Scientific, Singapore (1997) CrossRefGoogle Scholar
  11. 11.
    Courcelle, B., Downey, R.G., Fellows, M.R.: A note on the computability of graph minor obstruction sets for monadic second order ideals. J. Univers. Comput. Sci. 3, 1194–1198 (1997) zbMATHMathSciNetGoogle Scholar
  12. 12.
    Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173. Springer, Berlin (2005) zbMATHGoogle Scholar
  13. 13.
    Downey, R.G., Fellows, M.R.: Fixed-parameter tractability and completeness. Congr. Numer. 87, 161–187 (1992) MathSciNetGoogle Scholar
  14. 14.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, New York (1999) CrossRefGoogle Scholar
  15. 15.
    Ebbinghaus, H.-D., Flum, J., Thomas, W.: Mathematical Logic, 2nd edn. Springer, Berlin (1994) zbMATHGoogle Scholar
  16. 16.
    Eppstein, D.: Subgraph isomorphism in planar graphs and related problems. J. Graph Algorithms Appl. 3(3), 1–27 (1999) MathSciNetGoogle Scholar
  17. 17.
    Fellows, M.R., Langston, M.A.: On search, decision, and the efficiency of polynomial-time algorithms. J. Comput. Syst. Sci. 49(3), 769–779 (1994) CrossRefzbMATHMathSciNetGoogle Scholar
  18. 18.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, New York (2006) Google Scholar
  19. 19.
    Flum, J., Frick, M., Grohe, M.: Query evaluation via tree-decompositions. J. ACM 49(6), 716–752 (2002) CrossRefMathSciNetGoogle Scholar
  20. 20.
    Garey, M.R., Johnson, D.S.: Crossing number is NP-complete. SIAM J. Algebr. Discrete Methods 4, 312–316 (1983) CrossRefzbMATHMathSciNetGoogle Scholar
  21. 21.
    Grohe, M.: Computing crossing numbers in quadratic time. J. Comput. Syst. Sci. 68(2), 285–302 (2004) CrossRefzbMATHMathSciNetGoogle Scholar
  22. 22.
    Hadlock, F.: Finding a maximum cut of a planar graph in polynomial time. SIAM J. Comput. 4(3), 221–225 (1975) CrossRefzbMATHMathSciNetGoogle Scholar
  23. 23.
    Hopcroft, J.E., Tarjan, R.E.: Efficient planarity testing. J. ACM 21(4), 549–568 (1974) CrossRefzbMATHMathSciNetGoogle Scholar
  24. 24.
    Kawarabayashi, K.: Planarity allowing few error vertices in linear time. In: FOCS 2009: Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science, pp. 639–648 (2009) CrossRefGoogle Scholar
  25. 25.
    Kawarabayashi, K., Reed, B.A.: Computing crossing number in linear time. In: STOC 2007: Proceedings of the 39th Annual ACM Symposium on Theory of Computing, pp. 382–390 (2007) CrossRefGoogle Scholar
  26. 26.
    Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20(2), 219–230 (1980) CrossRefzbMATHMathSciNetGoogle Scholar
  27. 27.
    Lipton, R.J., Tarjan, R.E.: Applications of a planar separator theorem. SIAM J. Comput. 9(3), 615–627 (1980) CrossRefzbMATHMathSciNetGoogle Scholar
  28. 28.
    Lokshtanov, D.: Wheel-free deletion is W[2]-hard. In: IWPEC 2008: Proceedings of the Third International Workshop on Parameterized and Exact Computation. Lecture Notes in Computer Science, vol. 5018, pp. 141–147. Springer, Berlin (2008) CrossRefGoogle Scholar
  29. 29.
    Marx, D.: Chordal deletion is fixed-parameter tractable. Algorithmica 57(4), 747–768 (2010) CrossRefzbMATHMathSciNetGoogle Scholar
  30. 30.
    Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications, vol. 31. Oxford University Press, Oxford (2006) CrossRefzbMATHGoogle Scholar
  31. 31.
    Perkovic, L., Reed, B.A.: An improved algorithm for finding tree decompositions of small width. Int. J. Found. Comput. Sci. 11(3), 365–371 (2000) CrossRefMathSciNetGoogle Scholar
  32. 32.
    Reed, B.A., Smith, K., Vetta, A.: Finding odd cycle transversals. Oper. Res. Lett. 32(4), 299–301 (2004) CrossRefzbMATHMathSciNetGoogle Scholar
  33. 33.
    Robertson, N., Seymour, P.D.: Graph minors. V. Excluding a planar graph. J. Comb. Theory, Ser. B 41(1), 92–114 (1986) CrossRefzbMATHMathSciNetGoogle Scholar
  34. 34.
    Robertson, N., Seymour, P.D.: Graph minors. XIII. The disjoint paths problem. J. Comb. Theory, Ser. B 63(1), 65–110 (1995) CrossRefzbMATHMathSciNetGoogle Scholar
  35. 35.
    Robertson, N., Seymour, P.D.: Graph minors. XX. Wagner’s conjecture. J. Comb. Theory, Ser. B 92(2), 325–357 (2004) CrossRefzbMATHMathSciNetGoogle Scholar
  36. 36.
    Robertson, N., Seymour, P.D., Thomas, R.: Quickly excluding a planar graph. J. Comb. Theory, Ser. B 62(2), 323–348 (1994) CrossRefzbMATHMathSciNetGoogle Scholar
  37. 37.
    Thomassen, C.: The graph genus problem is NP-complete. J. Algorithms 10(4), 568–576 (1989) CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  1. 1.Department of Computer Science and Information TheoryBudapest University of Technology and EconomicsBudapestHungary

Personalised recommendations