Journal of Algorithms
Efficient edge domination problems in graphs
Information Processing Letters
Combinatorial algorithms on a class of graphs
Discrete Applied Mathematics - Special issue: efficient algorithms and partial k-trees
Weighted independent perfect domination on cocomparability graphs
Discrete Applied Mathematics
Edge domination on bipartite permutation graphs and cotriangulated graphs
Information Processing Letters
The weighted perfect domination problem and its variants
Discrete Applied Mathematics
Weighted domination of cocomparability graphs
Discrete Applied Mathematics
Graph classes: a survey
Solving the weighted efficient edge domination problem on bipartite permutation graphs
Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Note: Efficient edge domination in regular graphs
Discrete Applied Mathematics
Graph Theory, Computational Intelligence and Thought
On the complexity of the dominating induced matching problem in hereditary classes of graphs
Discrete Applied Mathematics
Efficient edge domination on hole-free graphs in polynomial time
LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
EDGE DOMINATING SET: efficient enumeration-based exact algorithms
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Dominating induced matchings for p
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
An O(n)-time algorithm for the paired domination problem on permutation graphs
European Journal of Combinatorics
Hi-index | 0.04 |
Let G = (V,E) be a finite and undirected graph without loops and multiple edges. An edge is said to dominate itself and any edge adjacent to it. A subset D of E is called a perfect edge dominating set if every edge of E \ D is dominated by exactly one edge in D and an efficient edge dominating set if every edge of E is dominated by exactly one edge in D. The perfect (efficient) edge domination problem is to find a perfect (efficient) edge dominating set of minimum size in G. Suppose that each edge e is associated with a real number w(e) as its weight. Then, the weighted perfect (efficient) edge domination problem is to calculate a perfect (efficient) edge dominating set D such that the weight w(D) of D is minimum, where w(D)=Σe∈D w(e). In this paper, we show that the perfect (efficient) edge domination problem is NP-complete on bipartite (planar bipartite) graphs. Moreover, we present linear-time algorithms to solve the weighted perfect (efficient) edge domination problem on generalized series-parallel graphs and chordal graphs.