Exponential time algorithms for the minimum dominating set problem on some graph classes

Serge Gaspers (1) , Dieter Kratsch (2) , Mathieu Liedloff (3) , Ioan Todinca (3)

1 ALGCO - Algorithmes, Graphes et Combinatoire
2 LITA - Laboratoire d'Informatique Théorique et Appliquée
3 LIFO - Laboratoire d'Informatique Fondamentale d'Orléans

The Minimum Dominating Set problem remains NP-hard when restricted to any of the following graph classes: $c$-dense graphs, chordal graphs, $4$-chordal graphs, weakly chordal graphs and circle graphs. Developing and using a general approach, for each of these graph classes we present an exponential time algorithm solving the Minimum Dominating Set problem faster than the best known algorithm for general graphs. Our algorithms have the following running time: $O(1.4124^n)$ for chordal graphs, $O(1.4776^n)$ for weakly chordal graphs, $O(1.4845^n)$ for $4$-chordal graphs, $O(1.4887^n)$ for circle graphs, and $O(1.2273^{(1+\sqrt{1-2c})n})$ for $c$-dense graphs.

Domains: Data Structures and Algorithms [cs.DS]

Serge Gaspers, Dieter Kratsch, Mathieu Liedloff, Ioan Todinca. Exponential time algorithms for the minimum dominating set problem on some graph classes. ACM Transactions on Algorithms, 2009, 6, pp.article 9. ⟨10.1145/1644015.1644024⟩. ⟨hal-00460855⟩