A LINEAR RECOGNITION ALGORITHM FOR COGRAPHS

被引：398

作者：

CORNEIL, DG

PERL, Y

STEWART, LK

机构：

[1] RUTGERS STATE UNIV, DEPT COMP SCI, NEW BRUNSWICK, NJ 08903 USA

[2] BAR ILAN UNIV, RAMAT GAN, ISRAEL

来源：

关键词：

D O I：

10.1137/0214065

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：926 / 934

页数：9

共 13 条

[1] [Anonymous], 1971, STOC 71, DOI DOI 10.1145/800157.805047
[2] TESTING FOR CONSECUTIVE ONES PROPERTY, INTERVAL GRAPHS, AND GRAPH PLANARITY USING PQ-TREE ALGORITHMS
BOOTH, KS
LUEKER, GS
[J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1976, 13 (03) : 335 - 379
[3] COMPLEMENT REDUCIBLE GRAPHS
CORNEIL, DG
LERCHS, H
BURLINGHAM, LS
[J]. DISCRETE APPLIED MATHEMATICS, 1981, 3 (03) : 163 - 174
[4] CLUSTERING AND DOMINATION IN PERFECT GRAPHS
CORNEIL, DG
PERL, Y
[J]. DISCRETE APPLIED MATHEMATICS, 1984, 9 (01) : 27 - 39
[5] CORNEIL DG, 1984, UNPUB 15TH P SE C CO
[6] Garey MR., 1979, COMPUTERS INTRACTABI
[7] GOTLIEB CC, 1968, J ACM, V15, P493
[8] EFFICIENT PLANARITY TESTING
HOPCROFT, J
TARJAN, R
[J]. JOURNAL OF THE ACM, 1974, 21 (04) : 549 - 568
[9] Karp R. M., 1975, Networks, V5, P45
[10] Rose D. J., 1976, SIAM Journal on Computing, V5, P266, DOI 10.1137/0205021