Skip to main content
SpringerLink
Log in

Algorithm Engineering for Optimal Graph Bipartization

  • Conference paper
Book cover Experimental and Efficient Algorithms (WEA 2005)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 3503))

Included in the following conference series:

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.

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. Choi, H.-A., Nakajima, K., Rim, C.S.: Graph bipartization and via minimization. SIAM Journal on Discrete Mathematics 2(1), 38–47 (1989)

    Article  MATH  MathSciNet  Google Scholar 

  2. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)

    MATH  Google Scholar 

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

    Chapter  Google Scholar 

  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. Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer, Heidelberg (1999)

    Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  14. Mahajan, M., Raman, V.: Parameterizing above guaranteed values: MaxSat and MaxCut. Journal of Algorithms 31(2), 335–354 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  15. Makhorin, A.: GNU Linear Programming Kit Reference Manual Version 4.7. Dept. Applied Informatics, Moscow Aviation Institute (2004)

    Google Scholar 

  16. Marx, D.: Chordal deletion is fixed-parameter tractable. Dept. Computer Science, Budapest University of Technology and Economics (August 2004) Manuscript

    Google Scholar 

  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)

    Chapter  Google Scholar 

  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)

    Chapter  Google Scholar 

  19. Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. Journal of Computer and System Sciences 43, 425–440 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  20. Reed, B., Smith, K., Vetta, A.: Finding odd cycle transversals. Operations Research Letters 32(4), 299–301 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  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)

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

  1. Institut für Informatik, Friedrich-Schiller-Universität Jena, Ernst-Abbe-Platz 2, D-07743, Jena

    Falk Hüffner

Authors
  1. Falk Hüffner
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. CTI and Univ. of Patras, Greece

    Sotiris E. Nikoletseas

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hüffner, F. (2005). Algorithm Engineering for Optimal Graph Bipartization. In: Nikoletseas, S.E. (eds) Experimental and Efficient Algorithms. WEA 2005. Lecture Notes in Computer Science, vol 3503. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11427186_22

Download citation

  • DOI: https://doi.org/10.1007/11427186_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-25920-6

  • Online ISBN: 978-3-540-32078-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation