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

Fang Rong HSU
Man Kwan SHAN

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E86-A    No.10    pp.2704-2709
Publication Date: 2003/10/01
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: LETTER
Category: Graphs and Networks
Keyword: 
parallel algorithms,  EREW PRAM,  center problem,  interval graph,  circular-arc graph,  

Full Text: PDF(348.5KB)>>
Buy this Article


Summary: 
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. Our algorithms run in O(log n) time algorithm using O(n/log n) processors while the intervals and arcs are given in sorted order. Our algorithms are on the EREW PRAM model.

open access publishing via