Advertisement

Compressing Bounded Degree Graphs

  • Pål Grønås Drange
  • Markus DregiEmail author
  • R. B. Sandeep
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9644)

Abstract

Recently, Aravind et al. (IPEC 2014) showed that for any finite set of connected graphs \(\mathcal {H}\), the problem \(\mathcal {H}\)-Free Edge Deletion admits a polynomial kernelization on bounded degree input graphs. We generalize this theorem by no longer requiring the graphs in \(\mathcal {H}\) to be connected. Furthermore, we complement this result by showing that also \(\mathcal {H}\)-Free Edge Editing admits a polynomial kernelization on bounded degree input graphs.

We show that there exists a finite set \(\mathcal {H}\) of connected graphs such that \(\mathcal {H}\)-Free Edge Completion is incompressible even on input graphs of maximum degree 5, unless the polynomial hierarchy collapses to the third level. Under the same assumption, we show that \(C_{11}\) -free Edge Deletion—as well as \(\mathcal {H}\)-Free Edge Editing—is incompressible on 2-degenerate graphs.

Keywords

Connected Graph Maximum Degree Input Graph Polynomial Kernel Free Graph 
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.

References

  1. 1.
    Abu-Khzam, F.N.: A kernelization algorithm for \(d\)-hitting set. J. Comput. Syst. Sci. 76(7), 524–531 (2010)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Aravind, N.R., Sandeep, R.B., Sivadasan, N.: On polynomial kernelization of \(\cal {H}\)-free edge deletion. In: IPEC (2014)Google Scholar
  3. 3.
    Burzyn, P., Bonomo, F., Durán, G.: NP-completeness results for edge modification problems. Discrete Appl. Math. 154(13), 1824–1844 (2006)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Proc. Lett. 58(4), 171–176 (1996)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Cai, L., Cai, Y.: Incompressibility of \(H\)-free edge modification problems. Algorithmica 71(3), 731–757 (2015)MathSciNetCrossRefzbMATHGoogle Scholar
  6. 6.
    Drange, P.G., Pilipczuk, M.: A polynomial kernel for trivially perfect editing. In: ESA (2015)Google Scholar
  7. 7.
    El-Mallah, E.S., Colbourn, C.J.: The complexity of some edge deletion problems. IEEE Trans. Circ. Syst. 35(3), 354–362 (1988)MathSciNetCrossRefzbMATHGoogle Scholar
  8. 8.
    Erdős, P., Rado, R.: Intersection theorems for systems of sets. J. Lond. Math. Soc. 1(1), 85–90 (1960)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Fellows, M.R., Langston, M.A., Rosamond, F.A., Shaw, P.: Efficient parameterized preprocessing for cluster editing. In: Csuhaj-Varjú, E., Ésik, Z. (eds.) FCT 2007. LNCS, vol. 4639, pp. 312–321. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  10. 10.
    Flum, J., Grohe, M.: Parameterized Complexity Theory. Springer, New York (2006)zbMATHGoogle Scholar
  11. 11.
    Garey, M.R., Johnson, D.S.: Computers and Intractability: a Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)zbMATHGoogle Scholar
  12. 12.
    Gramm, J., Guo, F., Hüffner, J., Niedermeier, R.: Data reduction and exact algorithms for clique cover. ACM J. Exp. Algorithmics 13, 1–14 (2008)MathSciNetzbMATHGoogle Scholar
  13. 13.
    Guillemot, S., Havet, F., Paul, C., Perez, A.: On the (non-)existence of polynomial kernels for \(P_l\)-free edge modification problems. Algorithmica 65(4), 900–926 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  14. 14.
    Guo, J.: Problem kernels for NP-complete edge deletion problems: split and related graphs. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 915–926. Springer, Heidelberg (2007)CrossRefGoogle Scholar
  15. 15.
    Komusiewicz, C., Uhlmann, J.: Cluster editing with locally bounded modifications. Discrete Appl. Math. 160(15), 2259–2270 (2012)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Kratsch, S., Wahlström, M.: Two edge modification problems without polynomial kernels. Discrete Optim. 10(3), 193–199 (2013)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is np-complete. J. Comput. Syst. Sci. 20(2), 219–230 (1980)MathSciNetCrossRefzbMATHGoogle Scholar
  18. 18.
    Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Appl. Math. 113(1), 109–128 (2001)MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Yannakakis, M.: Edge-deletion problems. SIAM J. Comput. 10(2), 297–309 (1981)MathSciNetCrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2016

Authors and Affiliations

  • Pål Grønås Drange
    • 1
  • Markus Dregi
    • 1
    Email author
  • R. B. Sandeep
    • 2
  1. 1.Department of InformaticsUniversity of BergenBergenNorway
  2. 2.Department of CSEIIT HyderabadMedakIndia

Personalised recommendations