Advertisement

An Exact 2.9416n Algorithm for the Three Domatic Number Problem

  • Tobias Riege
  • Jörg Rothe
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3618)

Abstract

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 3 n , up to polynomial factors. In this paper, we design an exact deterministic algorithm for this problem running in time 2.9416 n . 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.

Keywords

Exact algorithms domatic number problem 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [CH77]
    Cockayne, E., Hedetniemi, S.: Towards a theory of domination in graphs. Networks 7, 247–261 (1977)zbMATHCrossRefMathSciNetGoogle Scholar
  2. [FKW04]
    Fomin, F.V., Kratsch, D., Woeginger, G.J.: Exact (Exponential) algorithms for the dominating set problem. In: Hromkovič, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 245–256. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  3. [GJ79]
    Garey, M., Johnson, D.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman and Company, New York (1979)zbMATHGoogle Scholar
  4. [Law76]
    Lawler, E.: A note on the complexity of the chromatic number problem. Information Processing Letters 5(3), 66–67 (1976)zbMATHCrossRefMathSciNetGoogle Scholar
  5. [Sch05]
    Schöning, U.: Algorithmics in exponential time. In: Diekert, V., Durand, B. (eds.) STACS 2005. LNCS, vol. 3404, pp. 36–43. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  6. [Woe03]
    Woeginger, G.: Exact algorithms for NP-hard problems: A survey. In: Jünger, M., Reinelt, G., Rinaldi, G. (eds.) Combinatorial Optimization - Eureka, You Shrink! LNCS, vol. 2570, pp. 185–207. Springer, Heidelberg (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Tobias Riege
    • 1
  • Jörg Rothe
    • 1
  1. 1.Institut für InformatikHeinrich-Heine-Universität DüsseldorfDüsseldorfGermany

Personalised recommendations