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 条
  • [31] Efficient algorithms for centers and medians in interval and circular-arc graphs
    Bespamyatnikh, S
    Bhattacharya, B
    Keil, M
    Kirkpatrick, D
    Segal, M
    NETWORKS, 2002, 39 (03) : 144 - 152
  • [32] OPTIMAL PARALLEL CIRCLE COVER AND INDEPENDENT SET ALGORITHMS FOR CIRCULAR ARC GRAPHS
    YU, MS
    CHEN, CL
    LEE, RCT
    PROCEEDINGS OF THE 1989 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, VOL 3: ALGORITHMS AND APPLICATIONS, 1989, : 126 - 129
  • [33] Boxicity of Circular Arc Graphs
    Diptendu Bhowmick
    L. Sunil Chandran
    Graphs and Combinatorics, 2011, 27 : 769 - 783
  • [34] STABILITY IN CIRCULAR ARC GRAPHS
    GOLUMBIC, MC
    HAMMER, PL
    JOURNAL OF ALGORITHMS, 1988, 9 (03) : 314 - 320
  • [35] Boxicity of Circular Arc Graphs
    Bhowmick, Diptendu
    Chandran, L. Sunil
    GRAPHS AND COMBINATORICS, 2011, 27 (06) : 769 - 783
  • [36] An efficient parallel recognition algorithm for bipartite-permutation graphs
    Yu, CW
    Chen, GH
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1996, 7 (01) : 3 - 10
  • [37] EFFICIENT PARALLEL RECOGNITION ALGORITHMS OF COGRAPHS AND DISTANCE HEREDITARY GRAPHS
    DAHLHAUS, E
    DISCRETE APPLIED MATHEMATICS, 1995, 57 (01) : 29 - 44
  • [38] Linear-Time Recognition of Helly Circular-Arc Models and Graphs
    Benson L. Joeris
    Min Chih Lin
    Ross M. McConnell
    Jeremy P. Spinrad
    Jayme L. Szwarcfiter
    Algorithmica, 2011, 59 : 215 - 239
  • [39] Linear-Time Recognition of Helly Circular-Arc Models and Graphs
    Joeris, Benson L.
    Lin, Min Chih
    McConnell, Ross M.
    Spinrad, Jeremy P.
    Szwarcfiter, Jayme L.
    ALGORITHMICA, 2011, 59 (02) : 215 - 239
  • [40] Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
    Kaplan, Haim
    Nussbaum, Yahav
    DISCRETE APPLIED MATHEMATICS, 2009, 157 (15) : 3216 - 3230
12345