A simple parallel algorithm for the single-source shortest path problem on planar digraphs

doi:10.1006/jpdc.2000.1646

A simple parallel algorithm for the single-source shortest path problem on planar digraphs

2000-09-01

6

PRE

AI

J

Jesper Larsson Träff *

DOI：10.1006/jpdc.2000.1646

原文链接

原文求助

摘要

En 中文

We present a simple parallel algorithm for the single-source shortest path problem in planar digraphs with nonnegative real edge weights. The algorithm runs on the EREW PRAM model of parallel computation in O((n(2 epsilon) + n(1-epsilon)) log n) time, performing O(n(1+epsilon) log n) work for any 0<1/2. The strength of the algorithm is its simplicity, making it easy to implement and presumable quite efficient in practice. The algorithm improves upon the work of all previous parallel algorithms. Our algorithm is based on a region decomposition of the input graph and uses a well-known parallel implementation of Dijkstra's algorithm. The logarithmic factor in both the work and the time can be eliminated by plugging in a less practical, sequential planar shortest path algorithm together with an improved parallel implementation of Dijkstra's algorithm. (C) 2000 Academic Press.

Keyword:

GRAPHS

A simple parallel algorithm for the single-source shortest path problem on planar digraphs

摘要

期刊

机构

引用论文