PARALLEL ALGORITHMS FOR PERMUTATION GRAPHS

被引：3
|
作者：
YU, CW [1 ]
CHEN, GH [1 ]
机构：
[1] NATL TAIWAN UNIV, DEPT COMP SCI & INFORMAT ENGN, TAIPEI, TAIWAN
来源：
BIT NUMERICAL MATHEMATICS | 1993年 / 33卷 / 03期
关键词：
CLIQUES COVER PROBLEM; COLORING PROBLEM; LONGEST COMMON SUBSEQUENCE PROBLEM; MAXIMAL LAYERS PROBLEM; PARALLEL ALGORITHMS; PARALLEL RANDOM ACCESS MACHINE; PERMUTATION GRAPHS; TRANSITIVE ORIENTATION PROBLEM; WEIGHTED CLIQUE PROBLEM; WEIGHTED INDEPENDENT SET PROBLEM;
D O I：
10.1007/BF01990525
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
In this paper, parallel algorithms are presented for solving some problems on permutation graphs. The coloring problem is solved in O(log2n) time using O(n3/log n) processors on the CREW PRAM, or O(log n) time using O(n3) processors on the CRCW PRAM. The weighted clique problem, the weighted independent set problem, the cliques cover problem, and the maximal layers problem are all solved with the same complexities. We can also show that the longest common subsequence problem belongs to the class NC.
引用
收藏
页码：413 / 419
页数：7
相关论文
共 50 条
  • [1] EFFICIENT PARALLEL ALGORITHMS FOR PERMUTATION GRAPHS
    ARVIND, K
    KAMAKOTI, V
    RANGAN, CP
    [J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1995, 26 (01) : 116 - 124
  • [2] EFFICIENT PARALLEL ALGORITHMS FOR BIPARTITE PERMUTATION GRAPHS
    CHEN, L
    YESHA, Y
    [J]. NETWORKS, 1993, 23 (01) : 29 - 39
  • [3] A compact data structure and parallel algorithms for permutation graphs
    Gustedt, J
    Morvan, M
    Viennot, L
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1995, 1017 : 372 - 380
  • [4] Provably fastest parallel algorithms for bipartite permutation graphs
    Chen, L
    Jiang, JY
    Nyeu, MT
    [J]. INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-IV, PROCEEDINGS, 1998, : 1774 - 1777
  • [5] Optimal sequential and parallel algorithms to compute a Steiner tree on permutation graphs
    Mondal, S
    Pal, M
    Pal, TK
    [J]. INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2003, 80 (08) : 937 - 943
  • [6] Coloring permutation graphs in parallel
    Nikolopoulos, SD
    [J]. DISCRETE APPLIED MATHEMATICS, 2002, 120 (1-3) : 165 - 195
  • [7] SOME EFFICIENT ALGORITHMS FOR PERMUTATION GRAPHS
    IBARRA, OH
    ZHENG, Q
    [J]. JOURNAL OF ALGORITHMS, 1994, 16 (03) : 453 - 469
  • [8] Certifying algorithms for recognizing interval graphs and permutation graphs
    Kratsch, Dieter
    McConnell, Ross M.
    Mehlhorn, Kurt
    Spinrad, Jeremy P.
    [J]. SIAM JOURNAL ON COMPUTING, 2006, 36 (02) : 326 - 353
  • [9] Certifying algorithms for recognizing interval graphs and permutation graphs
    Kratsch, D
    McConnell, RM
    Mehlhorn, K
    Spinrad, JP
    [J]. PROCEEDINGS OF THE FOURTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2003, : 158 - 167
  • [10] Some results on ongoing research on parallel implementation of graph algorithms: the case of permutation graphs
    Lassous, IG
    Morvan, M
    [J]. INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-IV, PROCEEDINGS, 1998, : 325 - 332
12345