Parallel algorithms for index-permutation graphs. An extension of Cayley graphs for multiple chip-multiprocessors (MCMP)

2001 ◽  
Author(s):  
C.-H. Yeh ◽  
B. Parhami
Keyword(s):  
Parallel Algorithms ◽  
Chip Multiprocessors ◽  
Cayley Graphs ◽  
Permutation Graphs

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

Efficient Parallel Algorithms for Permutation Graphs

1995 ◽  
Vol 26 (1) ◽  
pp. 116-124 ◽  
Author(s):  
K. Arvind ◽  
V. Kamakoti ◽  
C.P. Rangan
Keyword(s):  
Parallel Algorithms ◽  
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.

Sign in / Sign up

Export Citation Format

Share Document