Algorithm Engineering for Optimal Graph Bipartization [chapter]

Falk Hüffner
2005 Lecture Notes in Computer Science  
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
more » ... ar 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.
doi:10.1007/11427186_22 fatcat:qzxhojrswrf45ks4zntpoacnsm