Add to ORKGWe provide an algorithm listing all minimal dominating sets of a graph on n vertices in time O(1:7159n). This result can be seen as an algorithmic proof of the fact that the number of minimal dominating sets in a graph on n vertices is at most 1:7159n, thus improving on the trivial O(2n=pn) bound. Our result makes use of the measure and conquer technique which was recently developed in the area of exact algorithms. Based on this result, we derive an O(2:8718n) algorithm for the domatic number problem
AbstractA dominating set of a graph G = (N,E) is a subset S of nodes such that every node is either ...
Listing, generating or enumerating objects of specified type is one of the principal tasks in algori...
AbstractAlber et al. presented an algorithm for computing a dominating set of size at most k, if one...
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in time O(1.715...
Abstract. We show that the number of minimal dominating sets in a graph on n vertices is at most 1.7...
We show how to count all minimum weighted dominating sets of a graph on n vertices in time O(1.5535 ...
AbstractThe measure and conquer approach has proven to be a powerful tool to analyse exact algorithm...
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for co...
We design fast exact algorithms for the problem of computing a minimum dominating set in undirected ...
AbstractThe currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n n...
We design fast exact algorithms for the problem of computing a minimum dominating set in undirected ...
Abstract. The maximum number of minimal dominating sets that a graph on n vertices can have is known...
AbstractA subset of vertices D⊆V of a graph G=(V,E) is a dominating clique if D is a dominating set ...
A dominating set of a graph G = (N,E) is a subset S of nodes such that every node is either in S or ...
Upper and lower bounds are obtained for the domination number of a graph, by means of a lemma involv...
AbstractA dominating set of a graph G = (N,E) is a subset S of nodes such that every node is either ...
Listing, generating or enumerating objects of specified type is one of the principal tasks in algori...
AbstractAlber et al. presented an algorithm for computing a dominating set of size at most k, if one...
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in time O(1.715...
Abstract. We show that the number of minimal dominating sets in a graph on n vertices is at most 1.7...
We show how to count all minimum weighted dominating sets of a graph on n vertices in time O(1.5535 ...
AbstractThe measure and conquer approach has proven to be a powerful tool to analyse exact algorithm...
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for co...
We design fast exact algorithms for the problem of computing a minimum dominating set in undirected ...
AbstractThe currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n n...
We design fast exact algorithms for the problem of computing a minimum dominating set in undirected ...
Abstract. The maximum number of minimal dominating sets that a graph on n vertices can have is known...
AbstractA subset of vertices D⊆V of a graph G=(V,E) is a dominating clique if D is a dominating set ...
A dominating set of a graph G = (N,E) is a subset S of nodes such that every node is either in S or ...
Upper and lower bounds are obtained for the domination number of a graph, by means of a lemma involv...
AbstractA dominating set of a graph G = (N,E) is a subset S of nodes such that every node is either ...
Listing, generating or enumerating objects of specified type is one of the principal tasks in algori...
AbstractAlber et al. presented an algorithm for computing a dominating set of size at most k, if one...