Skip to main content
SpringerLink
Log in

Graph Modification Problems: A Modern Perspective

  • Conference paper
  • First Online:
Frontiers in Algorithmics (FAW 2015)

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

Included in the following conference series:

Abstract

We give an overview of recent results and techniques in parameterized algorithms for graph modification problems.

Supported by the European Research Council (ERC) via grant Rigorous Theory of Preprocessing, reference 267959.

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. Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Inf. Process. Lett. 58(4), 171–176 (1996)

    Article  MATH  Google Scholar 

  2. Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Springer, Texts in Computer Science (2013)

    Book  MATH  Google Scholar 

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

    Google Scholar 

  4. Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Texts in Theoretical Computer Science. An EATCS Series. Springer, Heidelberg (2010)

    Book  MATH  Google Scholar 

  5. 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 

  6. Golumbic, M.C.: Algorithmic Graph Theory and Perfect Graphs. Annals of Discrete Mathematics, vol. 57, 2nd edn. Elsevier, Amsterdam (2004)

    MATH  Google Scholar 

  7. 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 

  8. 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 

  9. Michalewicz, Z., Fogel, D.B.: How to Solve It: Modern Heuristics. Springer, Heidelberg (2004)

    Book  MATH  Google Scholar 

  10. Motwani, R., Raghavan, P.: Randomized Algorithms. Cambridge University Press, New York (1995)

    Book  MATH  Google Scholar 

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

    Book  MATH  Google Scholar 

  12. Vazirani, V.V.: Approximation Algorithms. Springer, Heidelberg (2001)

    Google Scholar 

Download references

Acknowledgement

We thank Pål Grønås Drange for the figure.

Author information

Authors and Affiliations

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

    Fedor V. Fomin & Saket Saurabh

  2. Department of Computer Science and Automation, Indian Institute of Science, Bangalore, India

    Neeldhara Misra

Authors
  1. Fedor V. Fomin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Saket Saurabh
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Neeldhara Misra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Fedor V. Fomin .

Editor information

Editors and Affiliations

  1. Central South University, Changsha, China

    Jianxin Wang

  2. Courant Institute, New York University, New York, New York, USA

    Chee Yap

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Fomin, F.V., Saurabh, S., Misra, N. (2015). Graph Modification Problems: A Modern Perspective. In: Wang, J., Yap, C. (eds) Frontiers in Algorithmics. FAW 2015. Lecture Notes in Computer Science(), vol 9130. Springer, Cham. https://doi.org/10.1007/978-3-319-19647-3_1

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-19647-3_1

  • Published:

  • Publisher Name: Springer, Cham

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

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

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation