Gabriela R. Argiroffo

Learn More
In this work we obtain a new graph class where the {k}-dominating function problem ({k}-DOM) is NP-complete: the class of chordal graphs. We also identify some maximal subclasses for which it is polynomial time solvable. Firstly, by relating this problem with the k-dominating function problem (k-DOM), we prove that {k}-DOM is polynomial time solvable for(More)