Efficient parallel algorithms for bipartite permutation graphs

Networks ◽  
1993 ◽  
Vol 23 (1) ◽  
pp. 29-39 ◽  
Author(s):  
Lin Chen ◽  
Yaacov Yesha
Keyword(s):  
Parallel Algorithms ◽  
Permutation Graphs ◽  
Bipartite Permutation Graphs

PROVABLY FASTEST PARALLEL ALGORITHMS FOR BIPARTITE PERMUTATION GRAPHS

1999 ◽  
Vol 09 (03) ◽  
pp. 385-390 ◽  
Author(s):  
LIN CHEN ◽  
JULIUS Y. JIANG ◽  
MAUNG T. NYEU
Keyword(s):  
Parallel Algorithms ◽  
Shortest Path ◽  
Hamiltonian Path ◽  
Permutation Graphs ◽  
Crew Pram ◽  
Bipartite Permutation Graphs

Provably fastest parallel algorithms for a number of problems on bipartite permutation graphs are presented here. These problems include, among others, connectivity, recognition, isomorphism detection, Hamiltonian path, and shortest path. 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 and is subcubic.

Parallel algorithms for permutation graphs

1993 ◽  
Vol 33 (3) ◽  
pp. 413-419 ◽  
Author(s):  
Chang-Wu Yu ◽  
Gen-Huey Chen
Keyword(s):  
Parallel Algorithms ◽  
Permutation Graphs

Edge domination on bipartite permutation graphs and cotriangulated graphs

1995 ◽  
Vol 56 (3) ◽  
pp. 165-171 ◽  
Author(s):  
Anand Srinivasan ◽  
K. Madhukar ◽  
P. Nagavamsi ◽  
C.Pandu Rangan ◽  
Maw-Shang Chang
Keyword(s):  
Permutation Graphs ◽  
Bipartite Permutation Graphs
Sign in / Sign up

Export Citation Format

Share Document