Advertisement

Theory of Computing Systems

, Volume 64, Issue 2, pp 251–271 | Cite as

On the Parameterized Complexity of Graph Modification to First-Order Logic Properties

  • Fedor V. Fomin
  • Petr A. GolovachEmail author
  • Dimitrios M. Thilikos
Article
  • 8 Downloads

Abstract

We establish connections between parameterized/kernelization complexity of graph modification problems and expressibility in logic. For a first-order logic formula φ, we consider the problem of deciding whether an input graph can be modified by removing/adding at most k vertices/edges such that the resulting modification has the property expressible by φ. We provide sufficient and necessary conditions on the structure of the prefix of φ specifying when the corresponding graph modification problem is fixed-parameter tractable (parameterized by k) and when it admits a polynomial kernel.

Keywords

First-order logic Graph modification Parameterized complexity Descriptive complexity Kernelization 

Notes

Acknowledgments

We are grateful to Pål Drange for his very helpful remarks.

References

  1. 1.
    Abu-Khzam, F.N.: A kernelization algorithm for d-hitting set. J. Comput. Syst. Sci. 76, 524–531 (2010)MathSciNetCrossRefGoogle Scholar
  2. 2.
    Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75, 423–434 (2009)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discrete Math. 28, 277–305 (2014)MathSciNetCrossRefGoogle Scholar
  4. 4.
    Börger, E., Grädel, E., Gurevich, Y.: The Classical Decision Problem. Springer Science & Business Media, Berlin (2001)zbMATHGoogle Scholar
  5. 5.
    Cai, L., Cai, Y.: Incompressibility of H-free edge modification problems. Algorithmica 71, 731–757 (2015)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Cygan, M., Fomin, F.V., Kowalik, L., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Berlin (2015)CrossRefGoogle Scholar
  7. 7.
    Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity, Texts in Computer Science. Springer, Berlin (2013)CrossRefGoogle Scholar
  8. 8.
    Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: Complexity of Computation, vol. 7, pp. 43–74. AMS (1974)Google Scholar
  9. 9.
    Flum, J., Grohe, M.: Parameterized Complexity Theory, Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)Google Scholar
  10. 10.
    Frick, M., Grohe, M.: The complexity of first-order and monadic second-order logic revisited. Ann. Pure Appl. Logic 130, 3–31 (2004)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Gottlob, G., Kolaitis, P.G., Schwentick, T.: Existential second-order logic over graphs: Charting the tractability frontier. J. ACM 51, 312–362 (2004)MathSciNetCrossRefGoogle Scholar
  12. 12.
    Grohe, M.: Descriptive Complexity, Canonisation, and Definable Graph Structure Theory, vol. 47. Cambridge University Press, Cambridge (2017)CrossRefGoogle Scholar
  13. 13.
    Guillemot, S., Havet, F., Paul, C., Perez, A.: On the (non-)existence of polynomial kernels for p -free edge modification problems. Algorithmica 65, 900–926 (2013)MathSciNetCrossRefGoogle Scholar
  14. 14.
    Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63, 512–530 (2001)MathSciNetCrossRefGoogle Scholar
  15. 15.
    Kratsch, S., Wahlström, M.: Two edge modification problems without polynomial kernels. Discret. Optim. 10, 193–199 (2013)MathSciNetCrossRefGoogle Scholar
  16. 16.
    Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. J. Comput. Syst. Sci. 20, 219–230 (1980)MathSciNetCrossRefGoogle Scholar
  17. 17.
    Niedermeier, R.: Invitation to fixed-parameter algorithms, vol. 31 of Oxford Lecture Series in Mathematics and its Applications Oxford University Press (2006)Google Scholar
  18. 18.
    Smorynski, C.: The incompleteness theorems. In: Handbook of Mathematical Logic, vol. 90 of Stud. Logic Found. Math., pp. 821–865. North-Holland, Amsterdam (1977)Google Scholar
  19. 19.
    Vardi, M.Y.: The complexity of relational query languages (extended abstract). In: Proceedings of the 14th Annual ACM Symposium on Theory of Computing, May 5–7, 1982, pp. 137–146. ACM, San Francisco (1982)Google Scholar
  20. 20.
    Williams, R.: Faster decision of first-order graph properties. In: Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), CSL-LICS ’14, pp. 80:1–80:6. ACM, Vienna, July 14 - 18, 2014 (2014)Google Scholar
  21. 21.
    Yannakakis, M.: Edge-deletion problems. SIAM J. Comput. 10, 297–309 (1981)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media, LLC, part of Springer Nature 2019

Authors and Affiliations

  1. 1.Department of InformaticsUniversity of BergenBergenNorway
  2. 2.AlGCo Project Team, CNRS, LIRMMUniversité de MontpellierMontpellierFrance

Personalised recommendations