A Linear-Time Algorithm for the Maximum Restricted Paired-Domination Problem in Cographs
碩士 === 朝陽科技大學 === 資訊工程系碩士班 === 97 === Let G = (V;E) be a graph without isolated vertices. A set S ⊆ V is a paired-dominating set if every vertex in V − S is adjacent to a vertex in S and the subgraph G[S] induced by S contains a perfect matching M. The paired-domination problem is to find a paired-d...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2009
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/17244781782059681668 |