An optimal parallel algorithm for the perfect dominating set problem on distance-hereditary graphs

被引：0
|
作者：
Hsieh, SY [1 ]
Chen, GH
Ho, CW
机构：
[1] Natl Taiwan Univ, Dept Comp Sci & Informat Engn, Taipei 10764, Taiwan
[2] Natl Cent Univ, Dept Comp Sci & Informat Engn, Chungli 32054, Taiwan
来源：
ADVANCES IN COMPUTING SCIENCE-ASIAN' 98 | 1998年 / 1538卷
关键词：
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In the literature, there are quite a few sequential and parallel algorithms for solving problems on distance-hereditary graphs. With an n-vertex distance-hereditary graph G, we show that the perfect dominating set problem on G can be solved in O(log(2) n) time using O(n + m) procesors on a CREW PRAM.
引用
收藏
页码：113 / 124
页数：12
相关论文
共 50 条
12345