Subexponential Parameterized Algorithms for Cut and Cycle Hitting Problems on H-Minor-Free Graphs

Abstract

We design the first subexponential-time (parameterized) algorithms for several cut and cycle-hitting problems on H-minor free graphs. In particular, we obtain the following results (where k is the solutionsize parameter). 1) time algorithms for EDGE BIPARTIZATION and ODD CYCLE TRANSVERSAL; 1) time algorithm for VERTEX MULTIWAY CUT (with undeletable terminals), where r is the number of terminals to be separated;time algorithm for VERTEX MULTICUT (with undeletable terminals), where r is the number of terminal pairs to be separated;