Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity

by   Nina Chiarelli, et al.

We perform a systematic study in the computational complexity of the connected variant of three related transversal problems: Vertex Cover, Feedback Vertex Set, and Odd Cycle Transversal. Just like their original counterparts, these variants are NP-complete for general graphs. A graph G is H-free for some graph H if G contains no induced subgraph isomorphic to H. It is known that Connected Vertex Cover is NP-complete even for H-free graphs if H contains a claw or a cycle. We show that the two other connected variants also remain NP-complete if H contains a cycle or claw. In the remaining case H is a linear forest. We show that Connected Vertex Cover, Connected Feedback Vertex Set, and Connected Odd Cycle Transversal are polynomial-time solvable for sP_2-free graphs for every constant s≥ 1. For proving these results we use known results on the price of connectivity for vertex cover, feedback vertex set, and odd cycle transversal. This is the first application of the price of connectivity that results in polynomial-time algorithms.


page 1

page 2

page 3

page 4


On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest

A graph is H-free if it contains no induced subgraph isomorphic to H. We...

On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal

Let vc(G), fvs(G) and oct(G), respectively, denote the size of a minimum...

Computing Subset Vertex Covers in H-Free Graphs

We consider a natural generalization of Vertex Cover: the Subset Vertex ...

The Computational Complexity of Fire Emblem Series and similar Tactical Role-Playing Games

Fire Emblem (FE) is a popular turn-based tactical role-playing game (TRP...

Gerrymandering: A Briber's Perspective

We initiate the study of bribery problem in the context of gerrymanderin...

On the Complexity of Robust Multi-Stage Problems in the Polynomial Hierarchy

We study the computational complexity of multi-stage robust optimization...

Computational Complexity of Covering Disconnected Multigraphs

The notion of graph covers is a discretization of covering spaces introd...

Please sign up or login with your details

Forgot password? Click here to reset