Parallel Algorithms for Finding the Center and the median of Interval and Circular-arc Graphs

Abstract

The center problem of a graph is motivated by a number of facility location problems. In this paper, we propose parallel algorithms for finding the center of interval graphs and circular-arc graphs. We also consider the median problem of the interval graph. Our algorithms run in O(log n) time algorithm using O(O/log n)processors while the intervals and arcs are given in sorted order. Our algorithms are on the EREW PRAM model.