Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size

05/18/2018
by   Charis Papadopoulos, et al.
0

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 (weighted) size that intersects all cycles containing a vertex of a predescribed set of vertices. Although the two problems exhibit different computational complexity on split graphs, no similar characterization is known on other classes of graphs. Towards the understanding of the complexity difference between the two problems, it is natural to study the importance of a structural graph parameter. Here we consider graphs of bounded independent set number for which it is known that Weighted Feedback Vertex Set is solved in polynomial time. We provide a dichotomy result with respect to the size of a maximum independent set. In particular we show that Weighted Subset Feedback Vertex Set can be solved in polynomial time for graphs of independent set number at most three, whereas we prove that the problem remains NP-hard for graphs of independent set number four. Moreover, we show that the (unweighted) Subset Feedback Vertex Set problem can be solved in polynomial time on graphs of bounded independent set number by giving an algorithm with running time n^O(d), where d is the size of a maximum independent set of the input graph. To complement our results, we demonstrate how our ideas can be extended to other terminal set problems on graphs of bounded independent set size. Based on our findings for Subset Feedback Vertex Set, we settle the complexity of Node Multiway Cut, a terminal set problem that asks for a vertex set of minimum size that intersects all paths connecting any two terminals, as well as its variants where nodes are weighted and/or the terminals are deletable, for every value of the given independent set number.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/04/2021

Computing Subset Feedback Vertex Set via Leafage

Chordal graphs are characterized as the intersection graphs of subtrees ...
research
01/02/2022

Classifying Subset Feedback Vertex Set for H-Free Graphs

In the Feedback Vertex Set problem, we aim to find a small set S of vert...
research
10/10/2018

Extension of vertex cover and independent set in some classes of graphs and generalizations

We consider extension variants of the classical graph problems Vertex Co...
research
10/02/2019

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

The two weighted graph problems Node Multiway Cut (NMC) and Subset Feedb...
research
12/09/2022

Breaking the Barrier 2^k for Subset Feedback Vertex Set in Chordal Graphs

The Subset Feedback Vertex Set problem (SFVS), to delete k vertices from...
research
07/01/2022

Search-Space Reduction via Essential Vertices

We investigate preprocessing for vertex-subset problems on graphs. While...
research
10/16/2018

Multi-budgeted directed cuts

We study multi-budgeted variants of the classic minimum cut problem and ...

Please sign up or login with your details

Forgot password? Click here to reset