Bounding the number of minimal dominating sets: a measure and conquer approach

  • Authors:

  • Fedor V. Fomin;Fabrizio Grandoni;Artem V. Pyatkin;Alexey A. Stepanov

  • Affiliations:

  • Department of Informatics, University of Bergen, Bergen, Norway;Dipartimento di Informatica, Università di Roma “La Sapienza”, Roma, Italy;Department of Informatics, University of Bergen, Bergen, Norway;Department of Informatics, University of Bergen, Bergen, Norway

  • Venue:
  • ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

We show that the number of minimal dominating sets in a graph on n vertices is at most 1.7697n, thus improving on the trivial $\mathcal{O}(2^{n}/\sqrt{n})$ bound. Our result makes use of the measure and conquer technique from exact algorithms, and can be easily turned into an $\mathcal{O}(1.7697^{n})$ listing algorithm. Based on this result, we derive an $\mathcal{O}(2.8805^{n})$ algorithm for the domatic number problem, and an $\mathcal{O}(1.5780^{n})$ algorithm for the minimum-weight dominating set problem. Both algorithms improve over the previous algorithms.