Provably fastest parallel algorithms for bipartite permutation graphs

Parallel Processing Letters

Volumn 9, Issue 3, 1999, Pages 385-390

  Chen, Lin ^a  

^a FRL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; MATHEMATICAL MODELS; MATRIX ALGEBRA; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

BIPARTITE GRAPHS; PERMUTATION;

PARALLEL ALGORITHMS;

EID: 0033189760     PISSN: 02196264     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0129626499000359     Document Type: Article

References (3)

1. S. G. Akl. Parallel Computation: Models and Methods. Prentice-Hall, 1997.
2. L. Chen. Solving the shortest-paths problem on bipartite permutation graphs efficiently. Information Processing Letters, 55(5):259-264, September 1995.
3. L. Chen. Partitioning graphs into Hamiltonian ones. Parallel Computing, 22(4):607-618, June 1996.