Test case generators and computational results for the maximum clique problem

In the last years many algorithms have been proposed for solving the maximum clique problem. Most of these algorithms have been tested on randomly generated graphs. In this paper we present different test problem generators that arise from a variety of practical applications, as well as graphs with known maximum cliques. In addition, we provide computational experience with two exact algorithms using the generated test problems.

[1]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[2]  Panos M. Pardalos,et al.  Construction of test problems in quadratic bivalent programming , 1991, TOMS.

[3]  Jeffrey C. Lagarias,et al.  Keller’s cube-tiling conjecture is false in high dimensions , 1992 .

[4]  G. Hajós,et al.  Sur le problème de factorisation des groupes cycliques , 1950 .

[5]  Panos M. Pardalos,et al.  A branch and bound algorithm for the maximum clique problem , 1992, Comput. Oper. Res..

[6]  K. Corrádi,et al.  A combinatorial approach for Keller's conjecture , 1990 .

[7]  N. J. A. Sloane,et al.  A new table of constant weight codes , 1990, IEEE Trans. Inf. Theory.

[8]  Jue Xue.  Fast algorithms for vertex packing and related problems , 1991 .

[9]  Douglas M. Blough,et al.  Fault detection and diagnosis in multiprocessor systems , 1988 .

[10]  S. Szabó.  A reduction of Keller's conjecture , 1986 .

[11]  O. Perron,et al.  Über lückenlose Ausfüllung desn-dimensionalen Raumes durch kongruente Würfel , 1940 .

[12]  Egon Balas,et al.  Finding a Maximum Clique in an Arbitrary Graph , 1986, SIAM J. Comput..

[13]  O. Perron,et al.  Über lückenlose Ausfüllung desn-dimensionalen Raumes durch kongruente Würfel. II , 1940 .

[14]  GERNOT METZE,et al.  On the Connection Assignment Problem of Diagnosable Systems , 1967, IEEE Trans. Electron. Comput..

[15]  Panos M. Pardalos,et al.  The maximum clique problem , 1994, J. Glob. Optim..

[16]  P. Pardalos,et al.  An exact algorithm for the maximum clique problem , 1990 .

[17]  N. Sloane.  Unsolved Problems in Graph Theory Arising from the Study of Codes , 1989 .

[18]  Egon Balas,et al.  Addendum: Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs , 1992, SIAM J. Comput..