EFFICIENT PARALLEL RECOGNITION OF SOME CIRCULAR ARC GRAPHS .1.

被引：8
|
作者：
CHEN, L
机构：
[1] Department of Computer and Information Science, Ohio State University, Columbus, 43210, OH
来源：
ALGORITHMICA | 1993年 / 9卷 / 03期
关键词：
CIRCULAR ARC GRAPHS; INTERVAL GRAPHS; CONSECUTIVE ONES PROPERTY; PARALLEL ALGORITHM; PRAM; CLAW-FREE GRAPHS;
D O I：
10.1007/BF01190897
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
We present the first efficient parallel algorithms for recognizing some subclasses of circular arc graphs including GAMMA circular arc graphs and proper interval graphs. These algorithms run in 0(log2 n) time with 0(n3) processors on a CRCW PRAM. An intersection representation can also be constructed within the same resource bounds. Furthermore, we propose some new characterizations of THETA circular arc graphs and proper interval graphs.
引用
收藏
页码：217 / 238
页数：22
相关论文
共 50 条
12345