Algorithm Engineering for Optimal Graph Bipartization

Authors

  • Falk Hüffner

DOI:

https://doi.org/10.7155/jgaa.00177

Keywords:

NP-hard , graph bipartization , fixed-parameter algorithm , iterative compression

Abstract

We examine exact algorithms for the NP-hard GRAPH BIPARTIZATION problem. The task is, given a graph, to find a minimum set of vertices to delete to make it bipartite. Based on the "iterative compression" method introduced by Reed, Smith, and Vetta in 2004, we present new algorithms and experimental results. The worst-case time complexity is improved. Based on new structural insights, we give a simplified correctness proof. This also allows us to establish a heuristic improvement that in particular speeds up the search on dense graphs. Our best algorithm can solve all instances from a testbed from computational biology within minutes, whereas established methods are only able to solve about half of the instances within reasonable time.

Downloads

Download data is not yet available.

Downloads

Published

2009-02-01

How to Cite

Hüffner, F. (2009). Algorithm Engineering for Optimal Graph Bipartization. Journal of Graph Algorithms and Applications, 13(2), 77–98. https://doi.org/10.7155/jgaa.00177

Issue

Section

Articles

Categories