EFFICIENT PARALLEL ALGORITHMS FOR BIPARTITE PERMUTATION GRAPHS

被引：20
|
作者：
CHEN, L
YESHA, Y
机构：
[1] UNIV MARYLAND, DEPT COMP SCI, CATONSVILLE, MD 21228 USA
[2] UNIV MARYLAND, INST ADV COMP STUDIES, COLL PK, MD 20742 USA
来源：
NETWORKS | 1993年 / 23卷 / 01期
关键词：
D O I：
10.1002/net.3230230105
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we further study the properties of bipartite permutation graphs. We give first efficient parallel algorithms for several problems on bipartite permutation graphs. These problems include transforming a bipartite graph into a strongly ordered one if it is also a permutation graph; testing isomorphism; finding a Hamiltonian path/cycle; solving a variant of the crossing number problem; and others. All these problems can be solved in O(log2n) time with O(n3) processors on a Common CRCW PRAM. We also show that the minimum fill-in problem for bipartite permutation graphs can be solved efficiently by a randomized parallel algorithm.
引用
收藏
页码：29 / 39
页数：11
相关论文
共 50 条
  • [31] EFFICIENT ALGORITHMS FOR DOMINATION AND HAMILTON CIRCUIT PROBLEMS ON PERMUTATION GRAPHS
    SASTRY, PS
    JAYAKUMAR, N
    MADHAVAN, CEV
    LECTURE NOTES IN COMPUTER SCIENCE, 1987, 287 : 65 - 78
  • [32] Optimal sequential and parallel algorithms to compute a Steiner tree on permutation graphs
    Mondal, S
    Pal, M
    Pal, TK
    INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS, 2003, 80 (08) : 937 - 943
  • [33] EFFICIENT PARALLEL ALGORITHMS FOR SEVERAL INTERSECTION GRAPHS
    CHEN, L
    1989 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-3, 1989, : 973 - 976
  • [34] EFFICIENT PARALLEL ALGORITHMS ON INTERVAL-GRAPHS
    DAS, SK
    CHEN, CCY
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 605 : 131 - 143
  • [35] Efficient parallel algorithms on distance hereditary graphs
    Sun-Yuan, Hsieh
    Parallel Processing Letters, 1999, 9 (01): : 43 - 52
  • [36] Random Generation and Enumeration of Bipartite Permutation Graphs
    Saitoh, Toshiki
    Otachi, Yota
    Yamanaka, Katsuhisa
    Uehara, Ryuhei
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2009, 5878 : 1104 - +
  • [37] Bandwidth of bipartite permutation graphs in polynomial time
    Heggernes, Pinar
    Kratsch, Dieter
    Meister, Daniel
    LATIN 2008: THEORETICAL INFORMATICS, 2008, 4957 : 216 - +
  • [38] Tenacity and Rupture Degree of Permutation Graphs of Complete Bipartite Graphs
    Li, Fengwei
    Ye, Qingfang
    Li, Xueliang
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2011, 34 (03) : 423 - 434
  • [39] Isomorphism classes of bipartite cycle permutation graphs
    Kwak, JH
    Lee, J
    ARS COMBINATORIA, 1998, 50 : 139 - 148
  • [40] Parikh word representability of bipartite permutation graphs
    Teh, Wen Chean
    Ng, Zhen Chuan
    Javaid, Muhammad
    Chern, Zi Jing
    DISCRETE APPLIED MATHEMATICS, 2020, 282 : 208 - 221
12345