DeepAI
Log In Sign Up

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

10/11/2019
by   Konrad K. Dabrowski, et al.
0

Let vc(G), fvs(G) and oct(G), respectively, denote the size of a minimum vertex cover, minimum feedback vertex set and minimum odd cycle transversal in a graph G. One can ask, when looking for these sets in a graph, how much bigger might they be if we require that they are independent; that is, what is the price of independence? If G has a vertex cover, feedback vertex set or odd cycle transversal that is an independent set, then we let ivc(G), ifvs(G) or ioct(G), respectively, denote the minimum size of such a set. Similar to a recent study on the price of connectivity (Hartinger et al. EuJC 2016), we investigate for which graphs H the values of ivc(G), ifvs(G) and ioct(G) are bounded in terms of vc(G), fvs(G) and oct(G), respectively, when the graph G belongs to the class of H-free graphs. We find complete classifications for vertex cover and feedback vertex set and an almost complete classification for odd cycle transversal (subject to three non-equivalent open cases). We also investigate for which graphs H the values of ivc(G), ifvs(G) and ioct(G) are equal to vc(G), fvs(G) and oct(G), respectively, when the graph G belongs to the class of H-free graphs. We find a complete classification for vertex cover and almost complete classifications for feedback vertex set (subject to one open case) and odd cycle transversal (subject to three open cases).

READ FULL TEXT

page 1

page 2

page 3

page 4

07/28/2020

Computing Weighted Subset Transversals in H-Free Graphs

For the Odd Cycle Transversal problem, the task is to find a small set S...
11/11/2022

A Dynamic MaxSAT-based Approach to Directed Feedback Vertex Sets

We propose a new approach to the Directed Feedback Vertex Set Problem (D...
03/29/2022

Sparse Pose Graph Optimization in Cycle Space

The state-of-the-art modern pose-graph optimization (PGO) systems are ve...
11/03/2020

The Complexity of Finding Fair Independent Sets in Cycles

Let G be a cycle graph and let V_1,…,V_m be a partition of its vertex se...
02/07/2020

Population Monotonic Allocation Schemes for Vertex Cover Games

For the class of vertex cover games (introduced by Deng et al., Math. Op...
02/14/2022

Codes with structured Hamming distance in graph families

We investigate the maximum size of graph families on a common vertex set...