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