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

10/10/2018
by   Katrin Casel, et al.
0

We consider extension variants of the classical graph problems Vertex Cover and Independent Set. Given a graph G=(V,E) and a vertex set U ⊆ V, it is asked if there exists a minimal vertex cover (resp. maximal independent set) S with U⊆ S (resp. U ⊇ S). Possibly contradicting intuition, these problems tend to be NP-hard, even in graph classes where the classical problem can be solved in polynomial time. Yet, we exhibit some graph classes where the extension variant remains polynomial-time solvable. We also study the parameterized complexity of these problems, with parameter |U|, as well as the optimality of simple exact algorithms under the Exponential-Time Hypothesis. All these complexity considerations are also carried out in very restricted scenarios, be it degree or topological restrictions (bipartite, planar or chordal graphs). This also motivates presenting some explicit branching algorithms for degree-bounded instances. We further discuss the price of extension, measuring the distance of U to the closest set that can be extended, which results in natural optimization problems related to extension problems for which we discuss polynomial-time approximability.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
10/10/2018

On the Complexity of Solution Extension of Optimization Problems

The question if a given partial solution to a problem can be extended re...
research
05/18/2018

Subset Feedback Vertex Set on Graphs of Bounded Independent Set Size

The (Weighted) Subset Feedback Vertex Set problem is a generalization of...
research
02/23/2018

Homomorphism Extension

We define the Homomorphism Extension (HomExt) problem: given a group G, ...
research
12/09/2019

Multistage Graph Problems on a Global Budget

Time-evolving or temporal graphs gain more and more popularity when stud...
research
12/09/2019

Multistage Problems on a Global Budget

Time-evolving or temporal graphs gain more and more popularity when stud...
research
04/18/2023

On Approximate Reconfigurability of Label Cover

Given a two-prover game G and its two satisfying labelings ψ_𝗌 and ψ_𝗍, ...
research
03/11/2020

On Degree Sequence Optimization

We consider the problem of finding a subgraph of a given graph which max...

Please sign up or login with your details

Forgot password? Click here to reset