Skip to main content
SpringerLink
Log in

Editing to a Graph of Given Degrees

  • Conference paper
  • First Online:
Parameterized and Exact Computation (IPEC 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8894))

Included in the following conference series:

Abstract

We consider the Editing to a Graph of Given Degrees problem that for a graph \(G\), non-negative integers \(d,k\) and a function \(\delta :V(G)\rightarrow \{1,\ldots ,d\}\), asks whether it is possible to obtain a graph \(G'\) from \(G\) such that the degree of \(v\) is \(\delta (v)\) for any vertex \(v\) by at most \(k\) vertex or edge deletions or edge additions. We construct an FPT-algorithm for Editing to a Graph of Given Degrees parameterized by \(d+k\). We complement this result by showing that the problem has no polynomial kernel unless \(\mathrm{{NP}}\subseteq \mathrm{{coNP}}/\mathrm{{poly}}\).

The research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013)/ERC Grant Agreement n. 267959 and the Government of the Russian Federation (grant 14.Z50.31.0030).

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Alon, N., Shapira, A., Sudakov, B.: Additive approximation for edge-deletion problems. In: FOCS, pp. 419–428. IEEE Computer Society (2005)

    Google Scholar 

  2. Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844–856 (1995)

    Article  MATH  MathSciNet  Google Scholar 

  3. Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Cross-composition: a new technique for kernelization lower bounds. In: STACS. LIPIcs, vol. 9, pp. 165–176. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2011)

    Google Scholar 

  4. Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernelization lower bounds by cross-composition. CoRR abs/1206.5941 (2012)

  5. Burzyn, P., Bonomo, F., Durán, G.: NP-completeness results for edge modification problems. Discrete Appl. Math. 154(13), 1824–1844 (2006)

    Article  MATH  MathSciNet  Google Scholar 

  6. Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171–176 (1996)

    Article  MATH  Google Scholar 

  7. Cai, L., Chan, S.M., Chan, S.O.: Random separation: a new method for solving fixed-cardinality optimization problems. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 239–250. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  8. Cai, L., Yang, B.: Parameterized complexity of even/odd subgraph problems. J. Discrete Algorithms 9(3), 231–240 (2011)

    Article  MATH  MathSciNet  Google Scholar 

  9. Cygan, M., Marx, D., Pilipczuk, M., Pilipczuk, M., Schlotter, I.: Parameterized complexity of Eulerian deletion problems. In: Kolman, P., Kratochvíl, J. (eds.) WG 2011. LNCS, vol. 6986, pp. 131–142. Springer, Heidelberg (2011)

    Chapter  Google Scholar 

  10. Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An EATCS Series. Springer, Berlin (2006)

    Google Scholar 

  11. Froese, V., Nichterlein, A., Niedermeier, R.: Win-win kernelization for degree sequence completion problems. CoRR abs/1404.5432 (2014)

  12. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, New York (1979)

    MATH  Google Scholar 

  13. Golovach, P.A.: Editing to a connected graph of given degrees. CoRR abs/1308.1802 (2013)

  14. Golovach, P.A.: Editing to a graph of given degrees. CoRR abs/1311.4768 (2013)

  15. Khot, S., Raman, V.: Parameterized complexity of finding subgraphs with hereditary properties. Theor. Comput. Sci. 289(2), 997–1008 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  16. Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is np-complete. J. Comput. Syst. Sci. 20(2), 219–230 (1980)

    Article  MATH  MathSciNet  Google Scholar 

  17. Mathieson, L., Szeider, S.: Editing graphs to satisfy degree constraints: A parameterized approach. J. Comput. Syst. Sci. 78(1), 179–191 (2012)

    Article  MATH  MathSciNet  Google Scholar 

  18. Moser, H., Thilikos, D.M.: Parameterized complexity of finding regular induced subgraphs. J. Discrete Algorithms 7(2), 181–190 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  19. Naor, M., Schulman, L., Srinivasan, A.: Splitters and near-optimal derandomization. In: 36th Annual Symposium on Foundations of Computer Science (FOCS 1995), pp. 182–191. IEEE (1995)

    Google Scholar 

  20. Natanzon, A., Shamir, R., Sharan, R.: Complexity classification of some edge modification problems. Discrete Appl. Math. 113(1), 109–128 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  21. Niedermeier, R.: Invitation to Fixed-Parameter Algorithms, Oxford Lecture Series in Mathematics and Its Applications, vol. 31. Oxford University Press, Oxford (2006)

    Google Scholar 

  22. Seese, D.: Linear time computable problems and first-order descriptions. Math. Struct. Comput. Sci. 6(6), 505–526 (1996)

    MATH  MathSciNet  Google Scholar 

  23. Yannakakis, M.: Node- and edge-deletion NP-complete problems. In: Lipton, R.J., Burkhard, W.A., Savitch, W.J., Friedman, E.P., Aho, A.V. (eds.) STOC, pp. 253–264. ACM (1978)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Informatics, University of Bergen, Bergen, Norway

    Petr A. Golovach

  2. Steklov Institute of Mathematics at St. Petersburg, Russian Academy of Sciences, St. Petersburg, Russia

    Petr A. Golovach

Authors
  1. Petr A. Golovach
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Petr A. Golovach .

Editor information

Editors and Affiliations

  1. Faculty of Mathematics, Informatics and Mechanics, University of Warsaw, Warsaw, Poland

    Marek Cygan

  2. University of Bergen, Bergen, Norway

    Pinar Heggernes

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Golovach, P.A. (2014). Editing to a Graph of Given Degrees. In: Cygan, M., Heggernes, P. (eds) Parameterized and Exact Computation. IPEC 2014. Lecture Notes in Computer Science(), vol 8894. Springer, Cham. https://doi.org/10.1007/978-3-319-13524-3_17

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13524-3_17

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13523-6

  • Online ISBN: 978-3-319-13524-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation