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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Hüffner, F. (2005). Algorithm engineering for optimal graph bipartization. In Lecture Notes in Computer Science (Vol. 3503, pp. 240–252). Springer Verlag. https://doi.org/10.1007/11427186_22
Mendeley helps you to discover research relevant for your work.