6 citations · 27 across the 25 of their papers we have counts for
Showing 2019Show all
3 papers · 1 filter
cs.DS2019
Node Multiway Cut and Subset Feedback Vertex Set on Graphs of Bounded Mim-width
Benjamin Bergougnoux, Charis Papadopoulos, Jan Arne Telle
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 se…
cs.DS2019
Linear MIM-Width of Trees
Svein Høgemo, Jan Arne Telle, Erlend Raa Vågset
We provide an algorithm computing the linear maximum induced matching width of a tree and an optimal layout.
cs.DS2019
Typical Sequences Revisited --- Computing Width Parameters of Graphs
Hans L. Bodlaender, Lars Jaffke, Jan Arne Telle
In this work, we give a structural lemma on merges of typical sequences, a notion that was introduced in 1991 [Lagergren and Arnborg, Bodlaender and Kloks, both ICALP 1991] to obta…