# 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 vertices such that every vertex not in the set has at least k neighbors in the set. A total k-dominating set, also known as a k-tuple total dominating set, is a set of vertices such that every vertex of the graph has at least k neighbors in the set. The problems of finding the minimum size of a k-dominating, resp. total k-dominating set, in a given graph, are referred to as k-domination, resp. total k-domination. These generalizations of the classical domination and total domination problems are known to be NP-hard in the class of chordal graphs, and, more specifically, even in the classes of split graphs (both problems) and undirected path graphs (in the case of total k-domination). On the other hand, it follows from recent work by Kang et al. (2017) that these two families of problems are solvable in time O(|V(G)|^6k+4) in the class of interval graphs. In this work, we develop faster algorithms for k-domination and total k-domination in the class of proper interval graphs. The algorithms run in time O(|V(G)|^3k) for each fixed k> 1 and are also applicable to the weighted case.

• 5 publications
• 1 publication
• 1 publication
• 2 publications
• 27 publications
research
12/03/2018

### Total 2-domination of proper interval graphs

A set of vertices W of a graph G is a total k-dominating set when every ...
research
03/11/2020

### Balanced Independent and Dominating Sets on Colored Interval Graphs

We study two new versions of independent and dominating set problems on ...
research
07/17/2021

### 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...
research
07/22/2023

### Total Domination, Separated Clusters, CD-Coloring: Algorithms and Hardness

Domination and coloring are two classic problems in graph theory. The ma...
research
02/20/2020

### A general kernelization technique for domination and independence problems in sparse classes

We unify and extend previous kernelization techniques in sparse classes ...
research
11/29/2018

### The polytope of legal sequences

A sequence of vertices in a graph is called a (total) legal dominating s...
research
12/12/2022

### Degreewidth: a New Parameter for Solving Problems on Tournaments

In the paper, we define a new parameter for tournaments called degreewid...