Skip to main content
SpringerLink
Log in

Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph

  • Conference paper
SOFSEM 2010: Theory and Practice of Computer Science (SOFSEM 2010)

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

  • 875 Accesses

Abstract

We consider the following problem: given graph G and a set of graphs H = {H 1,...,H t }, what is the smallest subset S of edges in G such that all subgraphs of G that are isomorphic to one of the graphs from H contain at least one edge from S? Equivalently, we aim to find the minimum number of edges that needs to be removed from G to make it H-free. We concentrate on the case where all graphs H i are connected and have fixed size. Several algorithmic results are presented. First, we derive a polynomial time dynamic program for the problem on graphs of bounded treewidth and bounded maximum vertex degree. Then, if H contains only a clique, we adjust the dynamic program to solve the problem on graphs of bounded treewidth having arbitrary maximum vertex degree. Using the constructed dynamic programs, we design a Baker’s type approximation scheme for the problem on planar graphs. Finally, we observe that our results hold also if we cover only induced H-subgraphs.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alon, N., Krivelevich, M., Sudakov, B.: Maxcut in H-Free Graphs. Comb. Probab. Comput. 14(5-6), 629–647 (2005)

    Article  MATH  MathSciNet  Google Scholar 

  2. Baker, B.S.: Approximation Algorithms for NP-Complete Problems on Planar Graphs. J. ACM 41(1), 153–180 (1994)

    Article  MATH  Google Scholar 

  3. Bodlaender, H.L.: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth. SIAM J. Comput. 25(6), 1305–1317 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  4. Bodlaender, H.L.: A Partial k-Arboretum of Graphs with Bounded Treewidth. Theor. Comput. Sci. 209(1-2), 1–45 (1998)

    Article  MATH  MathSciNet  Google Scholar 

  5. Bodlaender, H.L.: Discovering Treewidth. In: Vojtáš, P., Bieliková, M., Charron-Bost, B., Sýkora, O. (eds.) SOFSEM 2005. LNCS, vol. 3381, pp. 1–16. Springer, Heidelberg (2005)

    Google Scholar 

  6. Bohman, T.: The Triangle-Free Process. Advances in Math. 221(5), 1653–1677 (2009)

    Article  MATH  MathSciNet  Google Scholar 

  7. Brügmann, D., Komusiewicz, C., Moser, H.: On Generating Triangle-Free Graphs. Electronic Notes in Discrete Mathematics 32, 51–58 (2009)

    Article  Google Scholar 

  8. Dunbar, J.E., Frick, M.: The Path Partition Conjecture is True for Claw-Free Graphs. Discrete Math. 307(11-12), 1285–1290 (2007)

    Article  MATH  MathSciNet  Google Scholar 

  9. Kammer, F.: Determining the Smallest k Such That G Is k-Outerplanar. In: Arge, L., Hoffmann, M., Welzl, E. (eds.) ESA 2007. LNCS, vol. 4698, pp. 359–370. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  10. Osthus, D., Taraz, A.: Random Maximal H-Free Graphs. Random Struct. Algorithms 18(1), 61–82 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  11. Robertson, N., Seymour, P.D., Thomas, R.: Hadwiger’s Conjecture for K 6-Free Graphs. Combinatorica 13(3), 279–361 (1993)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Business and Economics Department of Quantitative Economics, Maastricht University, PO Box 616, 6200 MD, Maastricht, The Netherlands

    Alexander Grigoriev, Bert Marchal & Natalya Usotskaya

Authors
  1. Alexander Grigoriev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Bert Marchal
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Natalya Usotskaya
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Information and Computing Sciences, Utrecht University, Padualaan 14, 3584 CH, Utrecht, The Netherlands

    Jan van Leeuwen

  2. LaBRI, Universit Bordeaux, 351 cours de la Libration, 1F-33405, Talence Cedex, France

    Anca Muscholl

  3. Department of Computer Science & Applied Mathematics, Weizmann Institute, Faculty of Mathematics and Computer Science, 76100, Rehovot, Israel

    David Peleg

  4. Department of Software Engineering Faculty of Mathematics and Physics Malostranské nám, Charles University, 25 11800, Prague 1, Czech Republic

    Jaroslav Pokorný

  5. Software Engineering, Department of Computer Science, RWTH Aachen University, 3, Ahornstrae 55, D-52074, Aachen, Germany

    Bernhard Rumpe

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grigoriev, A., Marchal, B., Usotskaya, N. (2010). Algorithms for the Minimum Edge Cover of H-Subgraphs of a Graph. In: van Leeuwen, J., Muscholl, A., Peleg, D., Pokorný, J., Rumpe, B. (eds) SOFSEM 2010: Theory and Practice of Computer Science. SOFSEM 2010. Lecture Notes in Computer Science, vol 5901. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-11266-9_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-11266-9_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-11265-2

  • Online ISBN: 978-3-642-11266-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation