| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 437960 | Theoretical Computer Science | 2009 | 9 Pages |
Abstract
Let G=(V,E) be a simple graph without isolated vertices. A vertex set S⊆V is a paired-dominating set if every vertex in V−S has a neighbor in S and the induced subgraph G[S] has a perfect matching. In this paper, we investigate the approximation hardness of paired-domination in graphs. For weighted paired-domination, an approximation algorithm in general graphs and an exact dynamic programming style algorithm in trees are also given.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
