Subset Feedback Vertex Set in Chordal and Split Graphs

by   Geevarghese Philip, et al.

In the Subset Feedback Vertex Set (Subset-FVS) problem the input is a graph G, a subset T of vertices of G called the `terminal' vertices, and an integer k. The task is to determine whether there exists a subset of vertices of cardinality at most k which together intersect all cycles which pass through the terminals. Subset-FVS generalizes several well studied problems including Feedback Vertex Set and Multiway Cut. This problem is known to be -Complete even in split graphs. Cygan et al. proved that Subset-FVS is fixed parameter tractable () in general graphs when parameterized by k [SIAM J. Discrete Math (2013)]. In split graphs a simple observation reduces the problem to an equivalent instance of the 3-Hitting Set problem with same solution size. This directly implies, for Subset-FVSrestricted to split graphs, (i) an algorithm which solves the problem in (2.076^k) time [The () notation hides polynomial factors.]Subset-FVS in Chordal kernel of size O(k^3). We improve both these results for Subset-FVS on split graphs; we derive (i) a kernel of size O(k^2) which is the best possible unless ⊆/ poly, and (ii) an algorithm which solves the problem in time O^*(2^k). Our algorithm, in fact, solves Subset-FVS on the more general class of chordal graphs, also in O^*(2^k) time.


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...

Parameterized algorithms and data reduction for the short secluded s-t-path problem

Given a graph G=(V,E), two vertices s,t∈ V, and two integers k,ℓ, we sea...

Search-Space Reduction via Essential Vertices

We investigate preprocessing for vertex-subset problems on graphs. While...

Speeding up Routing Schedules on Aisle-Graphs with Single Access

In this paper, we study the Orienteering Aisle-graphs Single-access Prob...

A Framework for Parameterized Subexponential Algorithms for Generalized Cycle Hitting Problems on Planar Graphs

Subexponential parameterized algorithms are known for a wide range of na...

DySky: Dynamic Skyline Queries on Uncertain Graphs

Given a graph, and a set of query vertices (subset of the vertices), the...

Parameterized algorithms and data reduction for safe convoy routing

We study a problem that models safely routing a convoy through a transpo...

Please sign up or login with your details

Forgot password? Click here to reset