The three domatic number problem asks whether a given undirected graph can be partitioned into at least three dominating sets, i.e., sets whose closed neighborhood equals the vertex set of the graph. Since this problem is NP-complete, no polynomial-time algorithm is known for it. The naive deterministic algorithm for this problem runs in time 3n, up to polynomial factors. In this paper, we design an exact deterministic algorithm for this problem running in time 2.9416n. Thus, our algorithm can handle problem instances of larger size than the naive algorithm in the same amount of time. We also present another deterministic and a randomized algorithm for this problem that both have an even better performance for graphs with small maximum degree. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Riege, T., & Rothe, J. (2005). An exact 2.94167n algorithm for the three domatic number problem. In Lecture Notes in Computer Science (Vol. 3618, pp. 733–744). Springer Verlag. https://doi.org/10.1007/11549345_63
Mendeley helps you to discover research relevant for your work.