skip to main content
research-article

An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL

Published:01 February 2023Publication History
Skip Abstract Section

Abstract

In general, a graph modification problem is defined by a graph modification operation ⊠ and a target graph property 𝒫. Typically, the modification operation ⊠ may be vertex deletion, edge deletion, edge contraction, or edge addition and the question is, given a graph G and an integer k, whether it is possible to transform G to a graph in 𝒫 after applying the operation ⊠ k times on G. This problem has been extensively studied for particular instantiations of ⊠ and 𝒫. In this article, we consider the general property 𝒫𝛗 of being planar and, additionally, being a model of some First-Order Logic (FOL) sentence 𝛗 (an FOL-sentence). We call the corresponding meta-problem Graph ⊠-Modification to Planarity and 𝛗 and prove the following algorithmic meta-theorem: there exists a function f : ℕ2 → ℕ such that, for every ⊠ and every FOL-sentence 𝛗, the Graph ⊠-Modification to Planarity and 𝛗 is solvable in f(k,|𝛗|)⋅ n2 time. The proof constitutes a hybrid of two different classic techniques in graph algorithms. The first is the irrelevant vertex technique that is typically used in the context of Graph Minors and deals with properties such as planarity or surface-embeddability (that are not FOL-expressible) and the second is the use of Gaifman’s locality theorem that is the theoretical base for the meta-algorithmic study of FOL-expressible problems.

REFERENCES

  1. [1] Adler Isolde, Kolliopoulos Stavros G., Krause Philipp Klaus, Lokshtanov Daniel, Saurabh Saket, and Thilikos Dimitrios M.. 2011. Tight bounds for linkages in planar graphs. In Automata, Languages and Programming. Lecture Notes in Computer Science, Vol. 6755. Springer, 110–121. DOI:Google ScholarGoogle ScholarCross RefCross Ref
  2. [2] Chekuri Chandra and Sidiropoulos Anastasios. 2018. Approximation algorithms for Euler genus and related problems. SIAM Journal on Computing 47, 4 (2018), 16101643. DOI:Google ScholarGoogle ScholarDigital LibraryDigital Library
  3. [3] Chuzhoy Julia. 2011. An algorithm for the graph crossing number problem. In Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC’11). ACM, New York, NY, 303312. DOI:Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. [4] Chuzhoy Julia, Makarychev Yury, and Sidiropoulos Anastasios. 2011. On graph crossing number and edge planarization. In Proceedings of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’11). 10501069. DOI:Google ScholarGoogle ScholarCross RefCross Ref
  5. [5] Courcelle Bruno. 1990. The monadic second-order logic of graphs. I. Recognizable sets of finite graphs. Information and Computation 85, 1 (1990), 1275. DOI:Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. [6] Courcelle Bruno. 1992. The monadic second-order logic of graphs III: Tree-decompositions, minor and complexity issues. Informatique Théorique et Applications 26 (1992), 257286. DOI:Google ScholarGoogle ScholarCross RefCross Ref
  7. [7] Courcelle Bruno and Engelfriet Joost. 2012. Graph Structure and Monadic Second-Order Logic—A Language-Theoretic Approach. Encyclopedia of Mathematics and Its Applications, Vol. 138. Cambridge University Press. https://www.labri.fr/perso/courcell/Book/TheBook.pdf.Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. [8] Courcelle Bruno and Oum Sang-Il. 2007. Vertex-minors, monadic second-order logic, and a conjecture by Seese. Journal of Combinatorial Theory: Series B 97, 1 (2007), 91126. DOI:Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. [9] Cygan Marek, Marx Dániel, Pilipczuk Marcin, and Pilipczuk Michal. 2013. The planar directed K-Vertex-Disjoint Paths problem is fixed-parameter tractable. In Proceedings of the 54th Annual IEEE Symposium on Foundations of Computer Science (FOCS’13). IEEE, Los Alamitos, CA, 197206. DOI:Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. [10] Dawar Anuj, Grohe Martin, and Kreutzer Stephan. 2007. Locally excluding a minor. In Proceedings of the 22nd IEEE Symposium on Logic in Computer Science (LICS’07). IEEE, Los Alamitos, CA, 270279. DOI:Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. [11] Demaine Erik D., Fomin Fedor V., Hajiaghayi Mohammad Taghi, and Thilikos Dimitrios M.. 2004. Bidimensional parameters and local treewidth. SIAM Journal on Discrete Mathematics 18, 3 (2004), 501511. DOI:Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. [12] Dvorák Zdenek, Král Daniel, and Thomas Robin. 2013. Testing first-order properties for subclasses of sparse graphs. Journal of the ACM 60, 5 (2013), Article 36, 24 pages. DOI:Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. [13] Flum Jörg and Grohe Martin. 2001. Fixed-parameter tractability, definability, and model-checking. SIAM Journal on Computing 31, 1 (2001), 113145. DOI:Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. [14] Flum Jörg and Grohe Martin. 2006. Parameterized Complexity Theory. Springer. DOI:Google ScholarGoogle ScholarCross RefCross Ref
  15. [15] Fomin Fedor V., Golovach Petr A., and Thilikos Dimitrios M.. 2011. Contraction obstructions for treewidth. Journal of Combinatorial Theory: Series B 101, 5 (2011), 302314. DOI:Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. [16] Frick Markus and Grohe Martin. 2001. Deciding first-order properties of locally tree-decomposable structures. Journal of the ACM 48, 6 (2001), 11841206. DOI:Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. [17] Gaifman Haim. 1982. On local and non-local properties. In Proceedings of the Herbrand Symposium.Studies in Logic and the Foundations of Mathematics, Vol. 107. Elsevier, 105135. DOI:Google ScholarGoogle ScholarCross RefCross Ref
  18. [18] Golovach Petr A., Kaminski Marcin, Maniatis Spyridon, and Thilikos Dimitrios M.. 2017. The parameterized complexity of graph cyclability. SIAM Journal on Discrete Mathematics 31, 1 (2017), 511541. DOI:Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. [19] Golovach Petr A., Hof Pim van ’t, and Paulusma Daniël. 2013. Obtaining planarity by contracting few edges. Theoretical Computer Science 476 (2013), 3846. DOI:Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. [20] Grohe Martin. 2008. Logic, graphs, and algorithms. In Logic and Automata: History and Perspectives. Texts in Logic and Games, Vol. 2. Amsterdam University Press, 357422.Google ScholarGoogle Scholar
  21. [21] Grohe Martin, Kawarabayashi Ken-Ichi, Marx Dániel, and Wollan Paul. 2011. Finding topological subgraphs is fixed-parameter tractable. In Proceedings of the 43rd ACM Symposium on Theory of Computing (STOC’11). ACM, New York, NY, 479488. DOI:Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. [22] Grohe Martin, Kreutzer Stephan, and Siebertz Sebastian. 2017. Deciding first-order properties of nowhere dense graphs. Journal of the ACM 64, 3 (2017), Article 17, 32 pages. DOI:Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. [23] Jansen Bart M. P., Lokshtanov Daniel, and Saurabh Saket. 2014. A near-optimal planarization algorithm. In Proceedings of the 25th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’14). 18021811. DOI:Google ScholarGoogle ScholarCross RefCross Ref
  24. [24] Kawarabayashi Ken-Ichi. 2009. Planarity allowing few error vertices in linear time. In Proceedings of the 50th Annual IEEE Symposium on Foundations of Computer Science (FOCS’09). IEEE, Los Alamitos, CA, 639648. DOI:Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. [25] Kreutzer Stephan. 2011. Algorithmic meta-theorems. In Finite and Algorithmic Model Theory. London Mathematical Society Lecture Note Series, Vol. 379. Cambridge University Press, 177270.Google ScholarGoogle ScholarCross RefCross Ref
  26. [26] Lewis John M. and Yannakakis Mihalis. 1980. The node-deletion problem for hereditary properties is NP-complete. Journal of Computer and System Sciences 20, 2 (1980), 219230. DOI:Google ScholarGoogle ScholarCross RefCross Ref
  27. [27] Marx Dániel. 2010. Can you beat treewidth?Theory of Computing 6, 1 (2010), 85112. DOI:Google ScholarGoogle ScholarCross RefCross Ref
  28. [28] Marx Dániel and Schlotter Ildikó. 2012. Obtaining a planar graph by vertex deletion. Algorithmica 62, 3–4 (2012), 807822. DOI:Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. [29] Robertson Neil and Seymour Paul D.. 1986. Graph minors. II. Algorithmic aspects of tree-width. Journal of Algorithms 7, 3 (1986), 309322. DOI:Google ScholarGoogle ScholarCross RefCross Ref
  30. [30] Robertson Neil and Seymour Paul D.. 1995. Graph minors. XIII. The disjoint paths problem. Journal of Combinatorial Theory: Series B 63, 1 (1995), 65110. DOI:Google ScholarGoogle ScholarDigital LibraryDigital Library
  31. [31] Robertson Neil and Seymour Paul D.. 2004. Graph minors. XX. Wagner’s conjecture. Journal of Combinatorial Theory: Series B 92, 2 (2004), 325357. DOI:Google ScholarGoogle ScholarDigital LibraryDigital Library
  32. [32] Seese Detlef. 1996. Linear time computable problems and first-order descriptions. Mathematical Structures in Computer Science 6, 6 (1996), 505526. DOI:Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in

      Full Access

      • Published in

        cover image ACM Transactions on Computation Theory
        ACM Transactions on Computation Theory  Volume 14, Issue 3-4
        December 2022
        122 pages
        ISSN:1942-3454
        EISSN:1942-3462
        DOI:10.1145/3582881
        Issue’s Table of Contents

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected].

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 1 February 2023
        • Online AM: 23 November 2022
        • Accepted: 10 November 2022
        • Revised: 4 November 2022
        • Received: 7 June 2021
        Published in toct Volume 14, Issue 3-4

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article
        • Refereed
      • Article Metrics

        • Downloads (Last 12 months)38
        • Downloads (Last 6 weeks)3

        Other Metrics

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader

      Full Text

      View this article in Full Text.

      View Full Text

      HTML Format

      View this article in HTML Format .

      View HTML Format
      About Cookies On This Site

      We use cookies to ensure that we give you the best experience on our website.

      Learn more

      Got it!