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 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 can be 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 NPhard 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.
BibTeX  Entry
@InProceedings{papadopoulos_et_al:LIPIcs:2019:10221,
author = {Charis Papadopoulos and Spyridon Tzimas},
title = {{Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size}},
booktitle = {13th International Symposium on Parameterized and Exact Computation (IPEC 2018)},
pages = {20:120:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959770842},
ISSN = {18688969},
year = {2019},
volume = {115},
editor = {Christophe Paul and Michal Pilipczuk},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2019/10221},
URN = {urn:nbn:de:0030drops102216},
doi = {10.4230/LIPIcs.IPEC.2018.20},
annote = {Keywords: Subset Feedback Vertex Set, Node Multiway Cut, Terminal Set problem, polynomialtime algorithm, NPcompleteness, W[1]hardness, graphs of bounded inde}
}
Keywords: 

Subset Feedback Vertex Set, Node Multiway Cut, Terminal Set problem, polynomialtime algorithm, NPcompleteness, W[1]hardness, graphs of bounded inde 
Collection: 

13th International Symposium on Parameterized and Exact Computation (IPEC 2018) 
Issue Date: 

2019 
Date of publication: 

05.02.2019 