Algorithm Engineering for Optimal Graph Bipartization

  • Falk Hüffner
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3503)

Abstract

We examine exact algorithms for the NP-complete Graph Bipartization problem that asks for a minimum set of vertices to delete from a graph to make it bipartite. Based on the “iterative compression” method recently introduced by Reed, Smith, and Vetta, we present new algorithms and experimental results. The worst-case time complexity is improved from O(3k · kmn) to O(3k · mn), where n is the number of vertices, m is the number of edges, and k is the number of vertices to delete. Our best algorithm can solve all problems from a testbed from computational biology within minutes, whereas established methods are only able to solve about half of the problems within reasonable time.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Choi, H.-A., Nakajima, K., Rim, C.S.: Graph bipartization and via minimization. SIAM Journal on Discrete Mathematics 2(1), 38–47 (1989)MATHCrossRefMathSciNetGoogle Scholar
  2. 2.
    Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)MATHGoogle Scholar
  3. 3.
    Dehne, F., Fellows, M.R., Langston, M.A., Rosamond, F.A., Stevens, K.: An O *(2O(k)) FPT algorithm for the undirected feedback vertex set problem. Manuscript (December 2004)Google Scholar
  4. 4.
    Dehne, F., Fellows, M.R., Rosamond, F.A., Shaw, P.: Greedy localization, iterative compression, and modeled crown reductions: New FPT techniques, an improved algorithm for set splitting, and a novel 2k kernelization for Vertex Cover. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol. 3162, pp. 271–280. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  5. 5.
    Downey, R.G.: Parameterized complexity for the skeptic. In: Proc. 18th IEEE Annual Conference on Computational Complexity, pp. 147–169 (2003)Google Scholar
  6. 6.
    Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)Google Scholar
  7. 7.
    Fellows, M.R.: Blow-ups, win/win’s, and crown rules: Some new directions in FPT. In: Bodlaender, H.L. (ed.) WG 2003. LNCS, vol. 2880, pp. 1–12. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  8. 8.
    Fellows, M.R.: New directions and new challenges in algorithm design and complexity, parameterized. In: Dehne, F., Sack, J.-R., Smid, M. (eds.) WADS 2003. LNCS, vol. 2748, pp. 505–520. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  9. 9.
    Garg, N., Vazirani, V.V., Yannakakis, M.: Approximate max-flow min-(multi)cut theorems and their applications. SIAM Journal on Computing 25(2), 235–251 (1996)MATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Guan, D.-J.: Generalized Gray codes with applications. Proceedings of the National Science Council, Republic of China (A) 22(6), 841–848 (1998)Google Scholar
  11. 11.
    Guo, J., Gramm, J., Hüffner, F., Niedermeier, R., Wernicke, S.: Improved fixed-parameter algorithms for two feedback set problems (February 2005) (Manuscript)Google Scholar
  12. 12.
    Kahng, A.B., Vaya, S., Zelikovsky, A.: New graph bipartizations for double-exposure, bright field alternating phase-shift mask layout. In: Proc. Asia and South Pacific Design Automation Conf., pp. 133–138. ACM, New York (2001)Google Scholar
  13. 13.
    Lewis, J.M., Yannakakis, M.: The node-deletion problem for hereditary properties is NP-complete. Journal of Computer and System Sciences 20(2), 219–230 (1980)MATHCrossRefMathSciNetGoogle Scholar
  14. 14.
    Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. Journal of Algorithms 31(2), 335–354 (1999)MATHCrossRefMathSciNetGoogle Scholar
  15. 15.
    Makhorin, A.: GNU Linear Programming Kit Reference Manual Version 4.7. Dept. Applied Informatics, Moscow Aviation Institute (2004)Google Scholar
  16. 16.
    Marx, D.: Chordal deletion is fixed-parameter tractable. Dept. Computer Science, Budapest University of Technology and Economics (August 2004) ManuscriptGoogle Scholar
  17. 17.
    Niedermeier, R.: Ubiquitous parameterization—invitation to fixed-parameter algorithms. In: Fiala, J., Koubek, V., Kratochvíl, J. (eds.) MFCS 2004. LNCS, vol. 3153, pp. 84–103. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  18. 18.
    Panconesi, A., Sozio, M.: Fast hare: A fast heuristic for single individual SNP haplotype reconstruction. In: Jonassen, I., Kim, J. (eds.) WABI 2004. LNCS (LNBI), vol. 3240, pp. 266–277. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  19. 19.
    Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43, 425–440 (1991)MATHCrossRefMathSciNetGoogle Scholar
  20. 20.
    Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Operations Research Letters 32(4), 299–301 (2004)MATHCrossRefMathSciNetGoogle Scholar
  21. 21.
    Rizzi, R., Bafna, V., Istrail, S., Lancia, G.: Practical algorithms and fixed-parameter tractability for the single individual SNP haplotyping problem. In: Guigó, R., Gusfield, D. (eds.) WABI 2002. LNCS, vol. 2452, pp. 29–43. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  22. 22.
    Wernicke, S.: On the algorithmic tractability of single nucleotide polymorphism (SNP) analysis and related problems. Diplomarbeit, Univ. Tübingen (September 2003)Google Scholar
  23. 23.
    Woeginger, G.J.: Exact algorithms for NP-hard problems: A survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol. 2570, pp. 185–208. Springer, Heidelberg (2003)CrossRefGoogle Scholar
  24. 24.
    Zhuang, X., Pande, S.: Resolving register bank conflicts for a network processor. In: Proc. 12th PACT, pp. 269–278. IEEE Press, Los Alamitos (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Falk Hüffner
    • 1
  1. 1.Institut für InformatikFriedrich-Schiller-Universität JenaJena

Personalised recommendations