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

Nina Chiarelli, Tatiana Romina Hartinger, Valeria Alejandra Leoni +2

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$-domi…