CLUSTERING AND DOMINATION IN PERFECT GRAPHS

被引：158

作者：

CORNEIL, DG

PERL, Y

机构：

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

[2] BAR ILAN UNIV,RAMAT GAN,ISRAEL

来源：

DISCRETE APPLIED MATHEMATICS | 1984年 / 9卷 / 01期

关键词：

All Open Access; Bronze; Green;

D O I：

10.1016/0166-218X(84)90088-X

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

MATHEMATICAL TECHNIQUES

引用

页码：27 / 39

页数：13

共 16 条

[1] DOMINATING SETS IN CHORDAL GRAPHS [J].

BOOTH, KS ;

JOHNSON, JH .

SIAM JOURNAL ON COMPUTING, 1982, 11 (01) :191-199

[2]

Cockayne E., 1975, Information Processing Letters, V4, P41, DOI 10.1016/0020-0190(75)90011-3

[3] COMPLEMENT REDUCIBLE GRAPHS [J].

CORNEIL, DG ;

LERCHS, H ;

BURLINGHAM, LS .

DISCRETE APPLIED MATHEMATICS, 1981, 3 (03) :163-174

[4]

CORNEIL DG, UNPUB DOMINATION K T

[5]

CORNEIL DG, 1984, UNPUB 15TH P SE C CO

[6]

Dewdney A., 1981, 71 U W ONT DEP COMP

[7]

FARBER M, UNPUB DOMINATION PER

[8]

Farber Miriam, COMMUNICATION

[9]

Garey Michael R., 1979, COMPUTERS INTRACTABI

[10]

Gavril F., 1972, SIAM Journal on Computing, V1, P180, DOI 10.1137/0201013

← 1 2 →