Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes

Serge Gaspers (1) , Dieter Kratsch (2) , Mathieu Liedloff (2)

1 UiB - Department of Informatics [Bergen]
2 LITA - Laboratoire d'Informatique Théorique et Appliquée

The Minimum Dominating Set problem remains NP-hard when restricted to chordal graphs, circle graphs and c-dense graphs (i.e. $|E| ≥cn^2$ for a constant c, 0

Domaines: Algorithme et structure de données [cs.DS]

Serge Gaspers, Dieter Kratsch, Mathieu Liedloff. Exponential Time Algorithms for the Minimum Dominating Set Problem on Some Graph Classes. SWAT'2006 : 10th Scandinavian Workshop on Algorithm Theory, Jul 2006, Riga, Latvia. pp.148-159, ⟨10.1007/11785293_16⟩. ⟨hal-00460694⟩