DeepAI AI Chat
Log In Sign Up

Balanced Independent and Dominating Sets on Colored Interval Graphs

by   Sujoy Bhore, et al.
University of Bonn

We study two new versions of independent and dominating set problems on vertex-colored interval graphs, namely f-Balanced Independent Set (f-BIS) and f-Balanced Dominating Set (f-BDS). Let G=(V,E) be a vertex-colored interval graph with a k-coloring γ V →{1,...,k} for some k ∈N. A subset of vertices S⊆ V is called f-balanced if S contains f vertices from each color class. In the f-BIS and f-BDS problems, the objective is to compute an independent set or a dominating set that is f-balanced. We show that both problems are -complete even on proper interval graphs. For the BIS problem on interval graphs, we design two algorithms, one parameterized by (f,k) and the other by the vertex cover number of G. Moreover, we present a 2-approximation algorithm for a slight variation of BIS on proper interval graphs.


page 1

page 2

page 3

page 4


Total 2-domination of proper interval graphs

A set of vertices W of a graph G is a total k-dominating set when every ...

The eternal dominating set problem for interval graphs

We prove that, in games in which all the guards move at the same turn, t...

On the Kernel and Related Problems in Interval Digraphs

Given a digraph G, a set X⊆ V(G) is said to be absorbing set (resp. domi...

Sparse dominating sets and balanced neighborhood partitioning

Recent work in metagenomics constructs a partition of the assembly graph...

New Algorithms for Weighted k-Domination and Total k-Domination Problems in Proper Interval Graphs

Given a positive integer k, a k-dominating set in a graph G is a set of ...

Prophet Inequalities on the Intersection of a Matroid and a Graph

We consider prophet inequalities in a setting where agents correspond to...

Finding Independent Transversals Efficiently

We give an efficient algorithm that, given a graph G and a partition V_1...