Skip to main content
SpringerLink
Log in

A Novel Branching Strategy for Parameterized Graph Modification Problems

  • Conference paper
Combinatorial Optimization and Applications (COCOA 2010)

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

Abstract

Many fixed-parameter tractable algorithms using a bounded search tree have been repeatedly improved, often by describing a larger number of branching rules involving an increasingly complex case analysis. We introduce a novel and general branching strategy that branches on the forbidden subgraphs of a relaxed class of graphs. By using the class of P 4-sparse graphs as the relaxed graph class, we obtain efficient bounded-search tree algorithms for several parameterized deletion problems. For the cograph edge-deletion problem and the trivially perfect edge-deletion problem, the branching strategy yields the first non-trivial bounded-search tree algorithms. For the cograph vertex deletion problem, the running time of our simple bounded search algorithm matches those previously designed with the help of complicated case distinctions and non-trivial running time analysis [16] and computer-aided branching rules [7].

Supported in part by NSERC Discovery Grant RGPIN 327587-09.

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brandstädt, A., Le, V.B., Spinrad, J.P.: Graph classes: a survey. Society for Industrial and Applied Mathematics, Philadelphia (1999)

    Google Scholar 

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

    Article  MathSciNet  MATH  Google Scholar 

  3. Coppersmith, D., Winograd, S.: Matrix multiplication via arithmetic progressions. J. Symb. Comput. 9(3), 251–280 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  4. Corneil, D.G., Perl, Y., Stewart, L.K.: A linear recognition algorithm for cographs. SIAM J. Comput. 14, 926–934 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  5. Cournier, A., Habib, M.: A new linear algorithm for modular decomposition. In: Tison, S. (ed.) CAAP 1994. LNCS, vol. 787, pp. 68–84. Springer, Heidelberg (1994)

    Google Scholar 

  6. Fouquet, J.-L., Giakoumakis, V.: On semi-P 4-sparse graphs. Discrete Mathematics 165-166, 277–300 (1997)

    Article  MathSciNet  MATH  Google Scholar 

  7. Gramm, J., Guo, J., Hüffner, F., Niedermeier, R.: Automated generation of search tree algorithms for hard graph modification problems. Algorithmica 39(4), 321–347 (2004)

    Article  MathSciNet  MATH  Google Scholar 

  8. Guo, J.: Problem kernels for NP-complete edge deletion problems. In: Tokuyama, T. (ed.) ISAAC 2007. LNCS, vol. 4835, pp. 915–926. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  9. Hoàng, C.T.: Perfect graphs (Ph.D. thesis). School of Computer Science, McGill University Montreal (1985)

    Google Scholar 

  10. Jamison, B., Olariu, S.: Recognizing P 4-sparse graphs in linear time. SIAM J. Comput. 21(2), 381–406 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kaplan, H., Shamir, R., Tarjan, R.E.: Tractability of parameterized completion problems on chordal, strongly chordal, and proper interval graphs. SIAM J. Comput. 28(5), 1906–1922 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kratsch, D., Spinrad, J.: Between O(nm) and O(n α). SIAM J. Comput. 36(2), 310–325 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  13. Lokshtanov, D., Mancini, F., Papadopoulos, C.: Characterizing and computing minimal cograph completions. Discrete Appl. Math. 158(7), 755–764 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  14. El Mallah, E.S., Colbourn, C.J.: Edge deletion problems: properties defined by weakly connected forbidden subgraphs. In: Proc. Eighteenth Southeastern Conference on Combinatorics, Graph Theory, and Computing, Congressus Numerantium, vol. 61, pp. 275–285 (1988)

    Google Scholar 

  15. McConnell, R.M., Spinrad, J.: Modular decomposition and transitive orientation. Discrete Mathematics 201(1-3), 189–241 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  16. Niedermeier, R., Rossmanith, P.: An efficient fixed-parameter algorithm for 3-hitting set. J. Discrete Algorithms 1(1), 89–102 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  17. Nikolopoulos, S.D., Palios, L.: Adding an edge in a cograph. In: Kratsch, D. (ed.) WG 2005. LNCS, vol. 3787, pp. 214–226. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  18. Seinsche, D.: On a property of the class of n-colorable graphs. J. Combin. Theory (B) 16(2), 191–193 (1974)

    Article  MathSciNet  MATH  Google Scholar 

  19. Tarjan, R.E., Yannakakis, M.: Addendum: Simple linear-time algorithms to test chordality of graphs, test acyclicity of hypergraphs, and selectively reduce acyclic hypergraphs. SIAM J. Comput. 14(1), 254–255 (1985)

    Article  MathSciNet  MATH  Google Scholar 

  20. Yan, J.-H., Chen, J.-J., Chang, G.J.: Quasi-threshold graphs. Discrete Applied Mathematics 69(3), 247–255 (1996)

    Article  MathSciNet  MATH  Google Scholar 

  21. Yannakakis, M.: The effect of a connectivity requirement on the complexity of maximum subgraph problems. J. ACM 26(4), 618–630 (1979)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Irving K. Barber School of Arts and Sciences, University of British Columbia Okanagan, Kelowna, Canada, V1V 1V7

    James Nastos & Yong Gao

Authors
  1. James Nastos
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yong Gao
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, University of Texas at Dallas, 75080, Richardson, TX, USA

    Weili Wu  & Ovidiu Daescu  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Nastos, J., Gao, Y. (2010). A Novel Branching Strategy for Parameterized Graph Modification Problems. In: Wu, W., Daescu, O. (eds) Combinatorial Optimization and Applications. COCOA 2010. Lecture Notes in Computer Science, vol 6509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17461-2_27

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17461-2_27

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17460-5

  • Online ISBN: 978-3-642-17461-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation