On the shortest path problem for permutation graphs

Abstract

The authors show that the single-source shortest path problem for permutation graphs can be solved in O(logn) time using O(n/logn) processors on an EREW PRAM. As an application, they show that a minimum connected dominating set of a permutation graph can be found in O(logn) time using O(n/logn) processors. The algorithms are optimal with respect to the time-processor product.<>