FINDING A MAXIMUM CLIQUE IN AN ARBITRARY GRAPH

被引：169

作者：

BALAS, E ^{[1
]}

YU, CS ^{[1
]}

机构：

[1] AT&T BELL LABS,MURRAY HILL,NJ 07974

来源：

关键词：

D O I：

10.1137/0215075

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

引用

页码：1054 / 1068

页数：15

共 16 条

[1]

BALAS E, 1977, NAV RES LOG, V24, P213, DOI 10.1002/nav.3800240203

[2]

Berge C, 1961, WISS ZM LUTHER U HAL, P114

[3] FINDING ALL CLIQUES OF AN UNDIRECTED GRAPH [H] [J].

BRON, C ;

KERBOSCH, J .

[4] CERTAIN POLYTOPES ASSOCIATED WITH GRAPHS [J].

CHVATAL, V .

[5]

Dirac Gabriel Andrew, 1961, ABH MATH SEM HAMBURG, V25, P71, DOI [DOI 10.1007/BF02992776, 10.1007/BF02992776]

[6] INCIDENCE MATRICES AND INTERVAL GRAPHS [J].

FULKERSON, DR ;

GROSS, OA .

[7]

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

[8] CLIQUE DETECTION FOR NONDIRECTED GRAPHS - 2 NEW ALGORITHMS [J].

GERHARDS, L ;

LINDENBERG, W .

[9]

Golumbic M. C., 1980, ALGORITHMIC GRAPH TH

[10]

GROTSCHEL M, 1984, TOPICS PERFECT GRAPH, P325