A LINEAR-TIME ALGORITHM TO SOLVE THE WEIGHTED PERFECT DOMINATION PROBLEM IN SERIES-PARALLEL GRAPHS

被引：7
|
作者：
YEN, CC
LEE, RCT
机构：
[1] NATL TSING HUA UNIV, DEPT COMP SCI, HSINCHU 30043, TAIWAN
[2] MINIST COMMUN, SWITCHING TECHNOL LAB, TELECOMMUN LABS, CHUNGLI 32020, TAIWAN
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 1994年 / 73卷 / 01期
关键词：
PERFECT DOMINATION; SERIES-PARALLEL GRAPH; PARSING TREE; DYNAMIC PROGRAMMING;
D O I：
10.1016/0377-2217(94)90163-5
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
In this paper, we consider the weighted perfect domination problem in series-parallel graphs. Suppose G = (V, E) is a graph in which every vertex x is-an-element-of V has a cost c(x) and every edge e is-an-element-of E has a cost c(e). The weighted perfect domination problem is to find a subset D subset-of V such that every vertex not in D is adjacent to exactly one vertex in D and its total cost c(D) = SIGMA{c(x): x is-an-element-of D} + SIGMA{c(x, y): x is-not-an-element-of D, y is-an-element-of D and (x, y) is-an-element-of E} is minimum. This problem is NP-complete for bipartite graphs and chordal graphs. In this paper, we present a linear time algorithm for the problem in series-parallel graphs.
引用
收藏
页码：192 / 198
页数：7
相关论文
共 50 条
12345