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 条

[41] Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs
Kaplan, Haim
Nussbaum, Yahav
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2006, 4271 : 289 - +
[42] An efficient certifying algorithm for the Hamiltonian cycle problem on circular-arc graphs
Hung, Ruo-Wei
Chang, Maw-Shang
THEORETICAL COMPUTER SCIENCE, 2011, 412 (39) : 5351 - 5373
[43] Clique graphs of Helly circular-arc graphs
Durán, G
Lin, MC
ARS COMBINATORIA, 2001, 60 : 255 - 271
[44] PATHS IN INTERVAL-GRAPHS AND CIRCULAR ARC GRAPHS
DAMASCHKE, P
DISCRETE MATHEMATICS, 1993, 112 (1-3) : 49 - 64
[45] An efficient parallel algorithm for maximum matching for some classes of graphs
Parfenoff, I
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1998, 52 (01) : 96 - 108
[46] On the dominating set in circular arc graphs
单而芳
康丽英
西安电子科技大学学报, 1996, (S1) : 129+126 - 128
[47] Pathwidth of circular-arc graphs
Suchan, Karol
Todinca, Ioan
GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 2007, 4769 : 258 - +
[48] Longest paths in circular arc graphs
Balister, PN
Györi, E
Lehel, J
Schelp, RH
COMBINATORICS PROBABILITY & COMPUTING, 2004, 13 (03): : 311 - 317
[49] CHARACTERIZING CIRCULAR-ARC GRAPHS
TUCKER, A
BULLETIN OF THE AMERICAN MATHEMATICAL SOCIETY, 1970, 76 (06) : 1257 - &
[50] Two remarks on circular arc graphs
Hell, P
Huang, J
GRAPHS AND COMBINATORICS, 1997, 13 (01) : 65 - 72

← 1 2 3 4 5 →