Minimum connected transversals in graphs : new hardness results and tractable cases using the price of connectivity
Chiarelli, Nina ...
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 \geq 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.
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Impact factor
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
PDF
