An Effective Branching Strategy for Some Parameterized Edge Modification Problems with Multiple Forbidden Induced Subgraphs

  • Yunlong Liu
  • Jianxin Wang
  • Chao Xu
  • Jiong Guo
  • Jianer Chen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7936)

Abstract

Branching on forbidden induced subgraphs is a genetic strategy to obtain parameterized algorithms for many edge modification problems. For such a problem in which the graph property is defined by multiple forbidden induced subgraphs, branching process is trivially performed on each subgraph. Thus, the size of the resulting search tree is dominated by the size of the largest forbidden subgraph. In this paper, we present a simple strategy for deriving significantly improved branching rules for dealing with multiple forbidden subgraphs by edge modifications. The basic idea hereby is that while constructing branching rules for the largest forbidden subgraph, we sufficiently take into account the structural relationship between it and other forbidden subgraphs. By applying this strategy, we obtain improved parameterized algorithms for edge modification problems for several graph properties such as proper interval, 3-leaf power, threshold and co-trivially perfect graphs.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bessy, S., Paul, C., Perez, A.: Polynomial Kernels for 3-Leaf Power Graph Modification Problems. Discrete Applied Mathematics 158(16), 1732–1744 (2010)MathSciNetMATHCrossRefGoogle Scholar
  2. 2.
    Bessy, S., Perez, A.: Polynomial kernels for proper interval completion and related problems. In: Owe, O., Steffen, M., Telle, J.A. (eds.) FCT 2011. LNCS, vol. 6914, pp. 229–239. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  3. 3.
    Brandstäda, A., Le, V.B., Spinrad, J.P.: Graph Classes: a Survey. SIAM Monographs on Discrete Mathematics and Applications (1999)Google Scholar
  4. 4.
    Cai, L.: Fixed-parameter tractability of graph modification problems for hereditary properties. Information Processing Letters 58(4), 171–196 (1996)MathSciNetMATHCrossRefGoogle Scholar
  5. 5.
    Dom, M., Guo, J., Hüffner, F., Niedermeier, R.: Error compensation in leaf power problems. Algorithmica 44(4), 363–381 (2006)MathSciNetMATHCrossRefGoogle Scholar
  6. 6.
    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)MathSciNetMATHCrossRefGoogle Scholar
  7. 7.
    Guo, J., Hüffner, F., Komusiewicz, C., Zhang, Y.: Improved algorithms for bicluster editing. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol. 4978, pp. 445–456. Springer, Heidelberg (2008)CrossRefGoogle Scholar
  8. 8.
    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
  9. 9.
    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)MathSciNetMATHCrossRefGoogle Scholar
  10. 10.
    Liu, Y., Wang, J., Guo, J., Chen, J.: Cograph editing: Complexity and parameterized algorithms. In: Fu, B., Du, D.-Z. (eds.) COCOON 2011. LNCS, vol. 6842, pp. 110–121. Springer, Heidelberg (2011)CrossRefGoogle Scholar
  11. 11.
    Nastos, J., Gao, Y.: A novel branching strategy for parameterized graph modification problems. In: Wu, W., Daescu, O. (eds.) COCOA 2010, Part II. LNCS, vol. 6509, pp. 332–346. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  12. 12.
    Niedermeier, R., Rossmanith, P.: A general method to speed up fixed-parameter tractable algorithms. Information Processing Letters 73, 125–129 (2000)MathSciNetMATHCrossRefGoogle Scholar
  13. 13.
    Sharan, R.: Graph modification problems and their applications to genomic research. PhD Thesis, Tel-Aviv University (2002)Google Scholar
  14. 14.
    Villanger, Y.: Proper interval vertex deletion. In: Raman, V., Saurabh, S. (eds.) IPEC 2010. LNCS, vol. 6478, pp. 228–238. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  15. 15.
    Wegner, G.: Eigenschaften der Nerven homologisch-einfacher Familien im R n. PhD thesis, Universität Göttingen (1967)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Yunlong Liu
    • 1
    • 2
  • Jianxin Wang
    • 1
  • Chao Xu
    • 1
  • Jiong Guo
    • 3
  • Jianer Chen
    • 1
    • 4
  1. 1.School of Information Science and EngineeringCentral South UniversityChangshaP.R. China
  2. 2.College of Mathematics and Computer Science, Key Laboratory of High Performance Computing and Stochastic Information Processing(Ministry of Education of China)Hunan Normal UniversityChangshaP.R. China
  3. 3.Universität des SaarlandesSaarbrückenGermany
  4. 4.Department of Computer Science and EngineeringTexas A&M UniversityCollege StationUSA

Personalised recommendations