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 a vertex-weighted graph G=(V, E) and a set S⊆ V, a subset feedback vertex set X is a
set of the vertices of G such that the graph induced by V∖ X has no cycle containing a vertex …

Abstract The (Weighted) Subset Feedback Vertex Set problem is a generalization of the
classical Feedback Vertex Set problem and asks for a vertex set of minimum (weight) size …

Abstract In the Subset Feedback Vertex Set (Subset-FVS) problem the input is a graph G on
n vertices, a subset T of vertices of G called the “terminal” vertices, and an integer k. The task …

In this paper, we give a framework to design exponential-time approximation schemes for
basic graph partitioning problems such as k-way cut, Multiway Cut, Steiner k-cut and …

We study the computational complexity of two well-known graph transversal problems,
namely Subset Feedback Vertex Set and Subset Odd Cycle Transversal, by restricting the …

Abstract The Restricted Subset Feedback Vertex Set problem (R-SFVS) takes a graph G=(V,
E), a terminal set T⊆ V, and an integer k as the input. The task is to determine whether there …

Abstract In the Directed Multiway Cut problem, we are given a directed graph G=(V, E) and a
subset T⊆ V, called the terminal set. The aim is to find a minimum sized set S⊆ V⧵ T, such …

We study the computational complexity of two well-known graph transversal problems,
namely Subset Feedback Vertex Set and Subset Odd Cycle Transversal, by restricting the …

Abstract The Restricted Subset Feedback Vertex Set problem (r-sfvs) takes a graph G=(V, E),
a terminal set T⊆ V, and an integer k as the input. The task is to determine whether there …