A Simple Parallel Algorithm for the Single-Source Shortest Path Problem on Planar Digraphs

By Träff J.L.   Zaroliagis C.D.  

Journal of Parallel and Distributed Computing, Vol. 60, Iss. 9, 2000-09 ,pp. : 1103-1124

Academic Press

Access to resources Recommend Favorite

Parallel Algorithm for Shortest Pairs of Edge-Disjoint Paths

By Banerjee S.   Ghosh R.K.   Reddy A.P.K.  

Journal of Parallel and Distributed Computing, Vol. 33, Iss. 2, 1996-03 ,pp. : 165-171

Academic Press

Access to resources Recommend Favorite

Termination Detection for Parallel Shortest Path Algorithms

By Hribar M.R.   Taylor V.E.   Boyce D.E.  

Journal of Parallel and Distributed Computing, Vol. 55, Iss. 2, 1998-12 ,pp. : 153-165

Academic Press

Access to resources Recommend Favorite

Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems

By Kavvadias D.J.   Pantziou G.E.   Spirakis P.G.   Zaroliagis C.D.  

Theoretical Computer Science, Vol. 168, Iss. 1, 1996-11 ,pp. : 121-154

Elsevier

Access to resources Recommend Favorite

Optimal Parallel Algorithms for Computer Vision Problems

By Wu C-H.   Horng S-J.   Tsai H-R.  

Journal of Parallel and Distributed Computing, Vol. 62, Iss. 6, 2002-06 ,pp. : 1021-1041

Academic Press

Access to resources Recommend Favorite