FINDING ALL CLIQUES OF AN UNDIRECTED GRAPH [H]

被引：1541

作者：

BRON, C

KERBOSCH, J

机构：

[1] TECHNOL UNIV EINDHOVEN,DEPT IND ENGN,POB 513,EINDHOVEN,NETHERLANDS

[2] TECHNOL UNIV EINDHOVEN,DEPT MATH,POB 513,EINDHOVEN,NETHERLANDS

来源：

关键词：

D O I：

10.1145/362342.362367

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

引用

页码：575 / 577

页数：3

共 6 条

[1] AN ANALYSIS OF SOME GRAPH THEORETICAL CLUSTER TECHNIQUES [J].

AUGUSTSO.JG ;

MINKER, J .

[2]

BIERSTONE E, UNPUBLISHED REPORT

[3]

BRON C, FINDING CLIQUES UNDI

[4] AN ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM [J].

LITTLE, JDC ;

MURTY, KG ;

SWEENEY, DW ;

KAREL, C .

[5] ON CLIQUES IN GRAPHS [J].

MOON, JW ;

MOSER, L .

[6] CORRECTIONS TO BIERSTONES ALGORITHM FOR GENERATING CLIQUES [J].

MULLIGAN, GD ;

CORNEIL, DG .