An Improved Exact Algorithm for the Domatic Number Problem

  title={An Improved Exact Algorithm for the Domatic Number Problem},
  author={Tobias Riege and J{\"o}rg Rothe and Holger Spakowski and Masaki Yamamoto},
  journal={2006 2nd International Conference on Information \& Communication Technologies},
  • Tobias Riege, J. Rothe, Masaki Yamamoto
  • Published 16 March 2006
  • Computer Science, Mathematics
  • 2006 2nd International Conference on Information & Communication Technologies

Tables from this paper

Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem
The deterministic time bounds are compared with the corresponding time bounds of randomized algorithms, which often run faster but only at the cost of having a certain error probability.
Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey
It is shown that it is DP-complete to decide whether or not a given graph can be colored with exactly four colors, where DP is the second level of the boolean hierarchy.
Polynomial Space Algorithms for Counting Dominating Sets and the Domatic Number
A novel treewidth based annotation procedure to deal with sparse instances is used, and an algorithm that counts the number of dominating sets of each size κ in a graph in $\mathcal{O}(1.5673^n)$ time and polynomial space is given.
An O*(2^n ) Algorithm for Graph Coloring and Other Partitioning Problems via Inclusion--Exclusion
  • M. Koivisto
  • Computer Science
    2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06)
  • 2006
We use the principle of inclusion and exclusion, combined with polynomial time segmentation and fast Mobius transform, to solve the generic problem of summing or optimizing over the partitions of n
Exact Exponential-Time Algorithms for Domination Problems in Graphs
This PhD thesis studies exact exponential-time algorithms for domination problems in graphs, which are algorithms that use a number of operations that is exponential in a complexity parameter of the input in the worst case and return an optimal solution to the problem.
A measure & conquer approach for the analysis of exact algorithms
The idea is that a smarter measure may capture behaviors of the algorithm that a standard measure might not be able to exploit, and hence lead to a significantly better worst-case time analysis, in order to step beyond limitations of current algorithms design.
Inclusion/Exclusion Meets Measure and Conquer
This paper shows that inclusion/exclusion as a branching rule can be combined in a branch-and-reduce algorithm with traditional branching rules and reduction rules, and obtains the currently fastest exact exponential-time algorithms for a number of domination problems in graphs.
A New Optimality Measure for Distance Dominating Sets
We study the problem of finding the smallest power of an input graph that has k disjoint dominating sets, where the ith power of an input graph G is constructed by adding edges between pairs of
Strong in-domatic number in digraphs
Let D = ( V, A ) be a digraph and S a partition of V ( D ). We say that S is a strong in-domatic partition if every S in S holds that every vertex not in S has at least one out-neighbor in S , that
Set Partitioning via Inclusion-Exclusion
The algorithms are based on the principle of inclusion-exclusion and the zeta transform and get exact algorithms in time for several well-studied partition problems including domatic number, chromaticNumber, maximum $k$-cut, bin packing, list coloring, and the chromatic polynomial.


An Exact 2.9416n Algorithm for the Three Domatic Number Problem
This paper designs an exact deterministic algorithm that can handle problem instances of larger size than the naive algorithm in the same amount of time and presents another deterministic and a randomized algorithm for this problem that both have even better performance for graphs with small maximum degree.
Improved upper bounds for 3-SAT
For small k’s, especially for k = 3, there exists a lot of algorithms which run significantly faster than the trivial 2 bound, the following list summarizes those algorithms where a constant c means that the algorithm runs in time O(c).
An improved exponential-time algorithm for k-SAT
It is shown that, for each k, the running time of ResolveSat on a k-CNF formula is significantly better than 2/sup n/, even in the worst case, and the idea of succinctly encoding satisfying solutions can be applied to obtain lower bounds on circuit site.
Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem
  • Tobias Riege, J. Rothe
  • Mathematics
    Proceedings. 2004 International Conference on Information and Communication Technologies: From Theory to Applications, 2004.
  • 2004
It is proved that the exact versions of the domatic number problem are complete for the levels of the Boolean hierarchy over NP, the 2kth level of the boolean hierarchy overNP.
Approximating the domatic number
D domatic number is made the first natural maximization problem (known to the authors) that is provably approximable to within polylogarithmic factors but no better.
A Probabilistic Algorithm for k-SAT and Constraint Satisfaction Problems
This analysis shows that for any satisfiable k-CNF formula with n variables this process has to be repeated only t times, on the average, to find a satisfying assignment, where t is within a polynomial factor of(2(1 1=k)).
Algorithmics in Exponential Time
The purpose of the current paper is to show cases in which the constant c could be significantly reduced, and to point out that there are some randomized exponential-time algorithms which use randomization in some new ways.
Measure and Conquer: Domination - A Case Study
Davis-Putnam-style exponential-time backtracking algorithms are the most common algorithms used for finding exact solutions of NP-hard problems; the running time of these algorithms is largely overestimated because of a “bad” choice of the measure.
A Probabilistic Algorithm for k -SAT Based on Limited Local Search and Restart
The analysis shows that for any satisfiable k -CNF formula with n variables the expected number of repetitions until a satisfying assignment is found this way is (2⋅ (k-1)/ k)n, and the algorithm presented here has a complexity which is within a polynomial factor of (\frac 4 3 )n .