An improved exact algorithm for the domatic number problem
T Riege, J Rothe, H Spakowski, M Yamamoto - Information Processing …, 2007 - Elsevier
The 3-domatic number problem asks whether a given graph can be partitioned into three
dominating sets. We prove that this problem can be solved by a deterministic algorithm in
time 2.695 n (up to polynomial factors) and in polynomial space. This result improves the
previous bound of 2.8805 n, which is due to Björklund and Husfeldt. To prove our result, we
combine an algorithm by Fomin et al. with Yamamoto's algorithm for the satisfiability
problem. In addition, we show that the 3-domatic number problem can be solved for graphs …
dominating sets. We prove that this problem can be solved by a deterministic algorithm in
time 2.695 n (up to polynomial factors) and in polynomial space. This result improves the
previous bound of 2.8805 n, which is due to Björklund and Husfeldt. To prove our result, we
combine an algorithm by Fomin et al. with Yamamoto's algorithm for the satisfiability
problem. In addition, we show that the 3-domatic number problem can be solved for graphs …