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

被引：1

作者：

Hsieh, Sun-Yuan ^{[1
]}

机构：

[1] Natl Cheng Kung Univ, Dept Comp Sci & Informat Engn, Tainan 70101, Taiwan

来源：

JOURNAL OF SUPERCOMPUTING | 2007年 / 39卷 / 01期

关键词：

parallel algorithms; parallel random access machine (PRAM); distance-hereditary graphs; the perfect domination problem;

D O I：

10.1007/s11227-006-0003-6

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

A graph is distance-hereditary if the distance stays the same between any of two vertices in every connected induced subgraph containing both. Two well-known classes of graphs, trees and cographs, both belong to distance-hereditary graphs. In this paper, we first show that the perfect domination problem can be solved in sequential linear-time on distance-hereditary graphs. By sketching some regular property of the problem, we also show that it can be easily parallelized on distance-hereditary graphs.

引用

页码：39 / 57

页数：19

共 50 条

[1] An efficient parallel strategy for the perfect domination problem on distance-hereditary graphs
Sun-Yuan Hsieh
[J]. The Journal of Supercomputing, 2007, 39 : 39 - 57
[2] An efficient parallel algorithm for the efficient domination problem on distance-hereditary graphs
Hsieh, SY
[J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2002, 13 (09) : 985 - 993
[3] Domination in distance-hereditary graphs
Chang, MS
Wu, SC
Chang, GJ
Yeh, HG
[J]. DISCRETE APPLIED MATHEMATICS, 2002, 116 (1-2) : 103 - 113
[4] Paired-Domination Problem on Distance-Hereditary Graphs
Ching-Chi Lin
Keng-Chu Ku
Chan-Hung Hsu
[J]. Algorithmica, 2020, 82 : 2809 - 2840
[5] Paired-Domination Problem on Distance-Hereditary Graphs
Lin, Ching-Chi
Ku, Keng-Chu
Hsu, Chan-Hung
[J]. ALGORITHMICA, 2020, 82 (10) : 2809 - 2840
[6] An optimal parallel algorithm for the perfect dominating set problem on distance-hereditary graphs
Hsieh, SY
Chen, GH
Ho, CW
[J]. ADVANCES IN COMPUTING SCIENCE-ASIAN' 98, 1998, 1538 : 113 - 124
[7] A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
Elisabeth Gassner
Johannes Hatzl
[J]. Computing, 2008, 82 : 171 - 187
[8] A parity domination problem in graphs with bounded treewidth and distance-hereditary graphs
Gassner, Elisabeth
Hatzl, Johannes
[J]. COMPUTING, 2008, 82 (2-3) : 171 - 187
[9] An efficient parallel strategy for the two-fixed-endpoint Hamiltonian path problem on distance-hereditary graphs
Hsieh, SY
[J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2004, 64 (05) : 662 - 685
[10] Parallel decomposition of distance-hereditary graphs
Hsieh, SY
[J]. PARALLEL COMPUTATION, 1999, 1557 : 417 - 426

← 1 2 3 4 5 →