Provably fastest parallel algorithms for bipartite permutation graphs

被引：0
|
作者：
Chen, L [1 ]
Jiang, JY [1 ]
Nyeu, MT [1 ]
机构：
[1] FRL, Los Angeles, CA 90018 USA
来源：
INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED PROCESSING TECHNIQUES AND APPLICATIONS, VOLS I-IV, PROCEEDINGS | 1998年
关键词：
bipartite permutation graphs; recognition; isomorphism; parallel algorithms; shared memory;
D O I：
暂无
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
Provably fastest parallel algorithms for a number of problems an bi-partite permutation graphs are presented here. These problems include: recognizing bipartite permutation graphs; testing isomorphism; finding a Hamiltonian path and a Hamiltonian cycle. The algorithms here all run in logarithmic time on CREW PRAM. The processor bound is the same as that for multiplying two matrices in logarithmic time on, the model.
引用
收藏
页码：1774 / 1777
页数：4
相关论文
共 50 条
  • [1] Provably fastest parallel algorithms for bipartite permutation graphs
    FRL, P. O. Box 18345, Los Angeles, CA 90018, United States
    Parallel Processing Letters, 1999, 9 (03): : 385 - 390
  • [2] EFFICIENT PARALLEL ALGORITHMS FOR BIPARTITE PERMUTATION GRAPHS
    CHEN, L
    YESHA, Y
    NETWORKS, 1993, 23 (01) : 29 - 39
  • [3] PARALLEL ALGORITHMS FOR PERMUTATION GRAPHS
    YU, CW
    CHEN, GH
    BIT NUMERICAL MATHEMATICS, 1993, 33 (03) : 413 - 419
  • [4] EFFICIENT PARALLEL ALGORITHMS FOR PERMUTATION GRAPHS
    ARVIND, K
    KAMAKOTI, V
    RANGAN, CP
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1995, 26 (01) : 116 - 124
  • [5] BIPARTITE PERMUTATION GRAPHS
    SPINRAD, J
    BRANDSTADT, A
    STEWART, L
    DISCRETE APPLIED MATHEMATICS, 1987, 18 (03) : 279 - 292
  • [6] An efficient parallel recognition algorithm for bipartite-permutation graphs
    Yu, CW
    Chen, GH
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1996, 7 (01) : 3 - 10
  • [7] Bandwidth of Bipartite Permutation Graphs
    Uehara, Ryuhei
    ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2008, 5369 : 824 - 835
  • [8] Bipartite Permutation Graphs Are Reconstructible
    Kiyomi, Masashi
    Saitoh, Toshiki
    Uehara, Ryuhei
    COMBINATORIAL OPTIMIZATION AND APPLICATIONS, PT II, 2010, 6509 : 362 - +
  • [9] A compact data structure and parallel algorithms for permutation graphs
    Gustedt, J
    Morvan, M
    Viennot, L
    GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1995, 1017 : 372 - 380
  • [10] BIPARTITE PERMUTATION GRAPHS ARE RECONSTRUCTIBLE
    Kiyomi, Masashi
    Saitoh, Toshiki
    Uehara, Ryuhei
    DISCRETE MATHEMATICS ALGORITHMS AND APPLICATIONS, 2012, 4 (03)
12345