## Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-Width

##### Journal article, Peer reviewed

##### Published version

##### View/Open

##### Date

2022##### Metadata

Show full item record##### Collections

- Department of Informatics [939]
- Registrations from Cristin [9958]

##### Abstract

The two weighted graph problems Node Multiway Cut (NMC) and Subset Feedback Vertex Set (SFVS) both ask for a vertex set of minimum total weight, that for NMC disconnects a given set of terminals, and for SFVS intersects all cycles containing a vertex of a given set. We design a meta-algorithm that allows to solve both problems in time \(2^{O(rw^3)}\cdot n^{4}\), \(2^{O(q^2\log (q))}\cdot n^{4}\), and \(n^{O(k^2)}\) where rw is the rank-width, q the \({\mathbb {Q}}\)-rank-width, and k the mim-width of a given decomposition. This answers in the affirmative an open question raised by Jaffke et al. (Algorithmica 82(1):118–145, 2020) concerning an XP algorithm for SFVS parameterized by mim-width. By a unified algorithm, this solves both problems in polynomial-time on the following graph classes: Interval, Permutation, and Bi-Interval graphs, Circular Arc and Circular Permutation graphs, Convex graphs, k-Polygon, Dilworth-k and Co-k-Degenerate graphs for fixed k; and also on Leaf Power graphs if a leaf root is given as input, on H -Graphs for fixed H if an H-representation is given as input, and on arbitrary powers of graphs in all the above classes. Prior to our results, only SFVS was known to be tractable restricted only on Interval and Permutation graphs, whereas all other results are new.