6 citations · 27 across the 25 of their papers we have counts for
Showing 2017 · cs.DSShow all
2 papers · 2 filters
cs.DS2017
A unified polynomial-time algorithm for Feedback Vertex Set on graphs of bounded mim-width
Lars Jaffke, O-joung Kwon, Jan Arne Telle
We give a first polynomial-time algorithm for (Weighted) Feedback Vertex Set on graphs of bounded maximum induced matching width (mim-width). Explicitly, given a branch decompositi…
cs.DS2017★ 1 cited
Polynomial-time algorithms for the Longest Induced Path and Induced Disjoint Paths problems on graphs of bounded mim-width
Lars Jaffke, O-joung Kwon, Jan Arne Telle
We give the first polynomial-time algorithms on graphs of bounded maximum induced matching width (mim-width) for problems that are not locally checkable. In particular, we give $n^…