An efficient parallel algorithm for the efficient domination problem on distance-hereditary graphs

被引：6
|
作者：
Hsieh, SY [1 ]
机构：
[1] Natl Cheng Kung Univ, Dept Comp Sci & Informat Engn, Tainan 701, Taiwan
来源：
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | 2002年 / 13卷 / 09期
关键词：
parallel algorithm; PRAM; distance-hereditary graphs; the efficient domination problem; binary tree contraction technique;
D O I：
10.1109/TPDS.2002.1036071
中图分类号：
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 and m-edge distance-hereditary graph G, we show that the efficient domination problem on G can be solved in O(log(n)(2)) time using O(n + m) processors on a CREW PRAM. Moreover, if a binary tree representation of G is given, the problem can be optimally solved in O(log n) time using O(n/log n) processors on an EREW PRAM.
引用
收藏
页码：985 / 993
页数：9
相关论文
共 50 条
12345