Solving connected dominating set faster than 2n

  • Authors:

  • Fedor V. Fomin;Fabrizio Grandoni;Dieter Kratsch

  • Affiliations:

  • Department of Informatics, University of Bergen, Bergen, Norway;Dipartimento di Informatica, Università di Roma “La Sapienza”, Roma, Italy;LITA, Université Paul Verlaine – Metz, Metz Cedex 01, France

  • Venue:
  • FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

In the connected dominating set problem we are given an n-node undirected graph, and we are asked to find a minimum cardinality connected subset S of nodes such that each node not in S is adjacent to some node in S. This problem is also equivalent to finding a spanning tree with maximum number of leaves. Despite its relevance in applications, the best known exact algorithm for the problem is the trivial Ω(2n) algorithm which enumerates all the subsets of nodes. This is not the case for the general (unconnected) version of the problem, for which much faster algorithms are available. Such difference is not surprising, since connectivity is a global property, and non-local problems are typically much harder to solve exactly. In this paper we break the 2n barrier, by presenting a simple O(1.9407n) algorithm for the connected dominating set problem. The algorithm makes use of new domination rules, and its analysis is based on the Measure and Conquer technique.