A note on the complexity of minimum dominating set

Authors:
Fabrizio Grandoni
Affiliations:
Max-Planck-Institut für Informatik, Stuhlsatzenhausweg 85, 66123 Saarbrücken, Germany
Venue:
Journal of Discrete Algorithms
Year:
2006

Citing 13
Cited 0

An O(20.304n) Algorithm for Solving Maximum Independent Set Problem

IEEE Transactions on Computers
Introduction to algorithms

Introduction to algorithms
An improved fixed-parameter algorithm for vertex cover

Information Processing Letters
Finding maximum independent sets in sparse and general graphs

Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
New upper bounds for maximum satisfiability

Journal of Algorithms
Improved algorithms for 3-coloring, 3-edge-coloring, and constraint satisfaction

SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Vertex cover: further observations and further improvements

Journal of Algorithms
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
A deterministic (2 - 2/(k+ 1))n algorithm for k-SAT based on local search

Theoretical Computer Science
Upper Bounds for MaxSat: Further Improved

ISAAC '99 Proceedings of the 10th International Symposium on Algorithms and Computation
3-coloring in time 0(1.3446^n): a no-MIS algorithm

FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
An Improved Exponential-Time Algorithm for k-SAT

FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
On efficient fixed-parameter algorithms for weighted vertex cover

Journal of Algorithms

Quantified Score

Hi-index	0.00

Visualization

Abstract

The currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n nodes is the trivial @W(2^n) algorithm which enumerates and checks all the subsets of nodes. In this paper we present a simple algorithm which solves this problem in O(1.81^n) time.