AbstractThe currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n nodes is the trivial Ω(2n) 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.81n) time
Abstract A dominating set is a subset of the nodes of a graph such that all nodes are in the set or ...
For nonempty ?, ? ? ?, a vertex set S in a graph G is a (?, ?)-dominating set if for all v ? S, |N(v...
AbstractIn the developing theory of polynomial/linear algorithms for various problems on certain cla...
AbstractThe currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n n...
AbstractA subset of vertices D⊆V of a graph G=(V,E) is a dominating clique if D is a dominating set ...
In this paper, we study the minimum dominating set (MDS) problem and the minimum total dominating se...
AbstractWe design fast exponential time algorithms for some intractable graph-theoretic problems. Ou...
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in time O(1:715...
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in time O(1.715...
We design fast exact algorithms for the problem of computing a minimum dominating set in undirected ...
AbstractWe study approximation hardness of the Minimum Dominating Set problem and its variants in un...
Abstract. We show that the number of minimal dominating sets in a graph on n vertices is at most 1.7...
In a simple connected graph $G=(V,E)$, a subset of vertices $S \subseteq V$ is a dominating set if a...
Includes bibliographical references (p. 4).Cover title.Research supported by a Vinton Hayes Fellowsh...
In this paper, we study a variant of the Minimum Dominating Set problem. Given an unweighted undirec...
Abstract A dominating set is a subset of the nodes of a graph such that all nodes are in the set or ...
For nonempty ?, ? ? ?, a vertex set S in a graph G is a (?, ?)-dominating set if for all v ? S, |N(v...
AbstractIn the developing theory of polynomial/linear algorithms for various problems on certain cla...
AbstractThe currently (asymptotically) fastest algorithm for minimum dominating set on graphs of n n...
AbstractA subset of vertices D⊆V of a graph G=(V,E) is a dominating clique if D is a dominating set ...
In this paper, we study the minimum dominating set (MDS) problem and the minimum total dominating se...
AbstractWe design fast exponential time algorithms for some intractable graph-theoretic problems. Ou...
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in time O(1:715...
We provide an algorithm listing all minimal dominating sets of a graph on n vertices in time O(1.715...
We design fast exact algorithms for the problem of computing a minimum dominating set in undirected ...
AbstractWe study approximation hardness of the Minimum Dominating Set problem and its variants in un...
Abstract. We show that the number of minimal dominating sets in a graph on n vertices is at most 1.7...
In a simple connected graph $G=(V,E)$, a subset of vertices $S \subseteq V$ is a dominating set if a...
Includes bibliographical references (p. 4).Cover title.Research supported by a Vinton Hayes Fellowsh...
In this paper, we study a variant of the Minimum Dominating Set problem. Given an unweighted undirec...
Abstract A dominating set is a subset of the nodes of a graph such that all nodes are in the set or ...
For nonempty ?, ? ? ?, a vertex set S in a graph G is a (?, ?)-dominating set if for all v ? S, |N(v...
AbstractIn the developing theory of polynomial/linear algorithms for various problems on certain cla...
DOI
Add to ORKG