The Bipartite Contraction problem is to decide, given a graph G and a parameter k, whether we can can obtain a bipartite graph from G by at most k edge contractions. The fixed-parameter tractability of the problem was shown by Heggernes et al. [13], with an algorithm whose running time has double-exponential dependence on k. We present a new randomized FPT algorithm for the problem, which is both conceptually simpler and achieves an improved 2O(k2) nm running time, i.e., avoiding the double-exponential dependence on k. The algorithm can be derandomized using standard techniques. © 2013 Springer International Publishing.
CITATION STYLE
Guillemot, S., & Marx, D. (2013). A faster FPT algorithm for bipartite contraction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8246 LNCS, pp. 177–188). https://doi.org/10.1007/978-3-319-03898-8_16
Mendeley helps you to discover research relevant for your work.