Optimal sequential and parallel algorithms to compute a Steiner tree on permutation graphs

被引：0

作者：

Mondal, S ^{[1
]}

Pal, M ^{[1
]}

Pal, TK ^{[1
]}

机构：

[1] Vidyasagar Univ, Dept Appl Math Oceanol & Comp Programming, Midnapore 721102, W Bengal, India

来源：

INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS | 2003年 / 80卷 / 08期

关键词：

parallel algorithms; analysis of algorithms; Steiner set; Steiner tree; permutation graphs;

D O I：

10.1080/0020716031000112330

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

This paper presents an optimal sequential and an optimal parallel algorithm to compute a minimum cardinality Steiner set and a Steiner tree. The sequential algorithm takes O (n) time and parallel algorithm takes O (log n) time and O (n /log n) processors on an EREW PRAM model.

引用

页码：937 / 943

页数：7

共 50 条

[31] OPTIMAL PARALLEL ALGORITHMS FOR PATH PROBLEMS ON PLANAR GRAPHS
SRIKRISHNA, G
RANGAN, CP
[J]. THEORETICAL COMPUTER SCIENCE, 1995, 145 (1-2) : 27 - 43
[32] OPTIMAL PARALLEL ALGORITHMS ON CIRCULAR-ARC GRAPHS
RAO, AS
RANGAN, CP
[J]. INFORMATION PROCESSING LETTERS, 1989, 33 (03) : 147 - 156
[33] OPTIMAL PARALLEL ALGORITHMS ON CIRCULAR-ARC GRAPHS
RAO, AS
RANGAN, CP
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1989, 405 : 44 - 55
[34] OPTIMAL PARALLEL COLORING ALGORITHMS FOR TOTALLY DECOMPOSABLE GRAPHS
LIN, R
OLARIU, S
[J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 1993, 48 (1-2) : 1 - 9
[35] OPTIMAL PARALLEL ALGORITHMS ON CIRCULAR-ARC GRAPHS
RAO, AS
RANGAN, CP
[J]. FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE ////, 1989, 405 : 44 - 55
[36] Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms
Abbas, N
Stewart, L
[J]. DISCRETE APPLIED MATHEMATICS, 1999, 91 (1-3) : 1 - 23
[37] Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
Demaine, Erik D.
Hajiaghayi, MohammadTaghi
Klein, Philip N.
[J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PT I, 2009, 5555 : 328 - +
[38] Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs
Demaine, Erik D.
Hajiaghayi, Mohammadtaghi
Klein, Philip N.
[J]. ACM TRANSACTIONS ON ALGORITHMS, 2014, 10 (03)
[39] CONNECTED DOMINATION AND STEINER SET ON WEIGHTED PERMUTATION GRAPHS
ARVIND, K
REGAN, CP
[J]. INFORMATION PROCESSING LETTERS, 1992, 41 (04) : 215 - 220
[40] NEAR OPTIMAL-ALGORITHMS FOR FINDING MINIMUM STEINER TREES ON RANDOM GRAPHS
KUCERA, L
MARCHETTISPACCAMELA, A
PROTASI, M
TALAMO, M
[J]. LECTURE NOTES IN COMPUTER SCIENCE, 1986, 233 : 501 - 511

← 1 2 3 4 5 →