AbstractAn independent dominating set of a graph G=(V,E) is a pairwise non-adjacent subset D of V such that every vertex not in D is adjacent to at least one vertex in D. Suppose each vertex in V is associated with a weight which is a real number. The weighted independent domination problem is to find an independent domination set of minimum total weights. This paper records an unpublished result of 20 years ago that the weighted independent domination problem is NP-complete for chordal graphs
An independent dominating set D of a graph G = (V,E) is a subset of vertices such that every vertex ...
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set an...
In the Independent set problem, the input is a graph $G$, every vertex has a non-negative integer we...
AbstractAn independent dominating set of a graph G=(V,E) is a pairwise non-adjacent subset D of V su...
An independent dominatingset of a graph G = (V; E) is a pairwise non-adjacent subset D of V such tha...
Weighted independent domination is an NP-hard graph problem, which remains computationally intractab...
INDEPENDENT DOMINATION is one of the rare problems for which the complexity of weighted and unweight...
AbstractWe present polynomial algorithms to locate minimum weight dominating sets and independent do...
Independent domination is one of the rare problems for which the complexity of weighted and unweight...
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set an...
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set an...
[[abstract]]A perfect dominating set of a graph G = (V, E) is a subset D of V such that every vertex...
AbstractSuppose G = (V, E) is a graph in which every vertex v ϵ V is associated with a cost c(v). Th...
AbstractA ρ-independent set S in a graph is parameterized by a set ρ of non-negative integers that c...
An independent dominating set D of a graph G = (V,E) is a subset of vertices such that every vertex ...
An independent dominating set D of a graph G = (V,E) is a subset of vertices such that every vertex ...
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set an...
In the Independent set problem, the input is a graph $G$, every vertex has a non-negative integer we...
AbstractAn independent dominating set of a graph G=(V,E) is a pairwise non-adjacent subset D of V su...
An independent dominatingset of a graph G = (V; E) is a pairwise non-adjacent subset D of V such tha...
Weighted independent domination is an NP-hard graph problem, which remains computationally intractab...
INDEPENDENT DOMINATION is one of the rare problems for which the complexity of weighted and unweight...
AbstractWe present polynomial algorithms to locate minimum weight dominating sets and independent do...
Independent domination is one of the rare problems for which the complexity of weighted and unweight...
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set an...
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set an...
[[abstract]]A perfect dominating set of a graph G = (V, E) is a subset D of V such that every vertex...
AbstractSuppose G = (V, E) is a graph in which every vertex v ϵ V is associated with a cost c(v). Th...
AbstractA ρ-independent set S in a graph is parameterized by a set ρ of non-negative integers that c...
An independent dominating set D of a graph G = (V,E) is a subset of vertices such that every vertex ...
An independent dominating set D of a graph G = (V,E) is a subset of vertices such that every vertex ...
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set an...
In the Independent set problem, the input is a graph $G$, every vertex has a non-negative integer we...