A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
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 solution-size parameter). 1. 2^O(√(k)log k)· n^O(1) time algorithms for Edge Bipartization and Odd Cycle Transversal; 2. a 2^O(√(k)log^4 k)· n^O(1) time algorithm for Edge Multiway Cut and a 2^O(r √(k)log k)· n^O(1) time algorithm for Vertex Multiway Cut, where r is the number of terminals to bearXiv:2111.14196v2 fatcat:2zgpjjrspjcqxm7u6xzhbneiwa