Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Balas, E. and J. Xue (1991), Minimum Weighted Coloring of Triangulated Graphs, with Application to Maximum Weight Vertex Packing and Clique Finding in Arbitrary Graphs,SIAM J. Computing 20(2), 209–221.
Balas, E. and C. S. Yu (1986), Finding a Maximum Clique in an Arbitrary Graph,SIAM J. Computing 14(4), 1054–1068.
Berman, P. and A. Pelc (1990), Distributed Fault Diagnosis for Multiprocessor Systems,Proc. of the 20th Annual Intern. Symp. on Fault-Tolerant Computing (Newcastle, UK), 340–346.
Blough, D. M. (1988), Fault Detection and Diagnosis in Multiprocessor Systems, Ph.D. Thesis, The John Hopkins University.
Brouwer, A. E., J. B. Shearer, N. J. A. Sloane, and W. D. Smith (1990), A New Table of Constant Weight Codes.IEEE Transactions on Information Theory 36(6), 1334–1380.
Carraghan, R. and P. M. Pardalos (1990), An Exact Algorithm for the Maximum Clique Problem,Operations Research Letters 9, 375–382.
Corrádi, K. and S. Szabó (1990), A Combinatorial Approach for Keller's Conjecture,Periodica Math. Hung. 21(2), 95–100.
Hajós, G. (1950), Sur la factorisation des abeliens,Casopis 74, 189–196.
Keller, O. H. (1930), Über die lückenlose Erfüllung des Raumes mit Würfeln,J. Reine Angew. Math. 163, 231–248.
Lagarias, J. C. and P. W. Shor (1992), Keller's Cube-Tiling Conjecture is False in High Dimensions,Bulletin AMS 27(2), 279–283.
MacWilliams, F. J. and N. J. A. Sloane (1979),The Theory of Error-Correcting Codes, North Holland, Amsterdam.
Pardalos, P. M. (1991), Construction of Test Problems in Quadratic Bivalent Programming,ACM Transactions on Mathematical Software 17(1), 74–87.
Pardalos, P. M. and G. P. Rodgers (1992), A Branch and Bound Algorithm for the Maximum Clique Problem,Computers and Operations Research 19(5), 363–375.
Pardalos, P. M. and G. Vairaktarakis (1992), Test Cases for the Maximum Clique Problem,COAL Bulletin 21, 19–23.
Pardalos, P. M. and J. Xue (1992), The Maximum Clique Problem, Manuscript, University of Florida.
Perron, O. (1940), Über lückenlose Ausfullung desn-dimensionalen Raumes durch kongruente Würfel,Math. Z. 46, 1–26, 161–180.
F. P. Preparata, G. Metze, and R. T. Chien (1967), On the Connection Assignment Problem of Diagnosable Systems,IEEE Trans. Electr. Comput. 16, 848–854.
Sanchis, L. (1992), Test Case Construction for the Vertex Cover Problem (extended abstract),DIMACS Workshop on Computational Support for Discrete Mathematics, March.
Sanchis, L. (1989), Test Case Construction for NP-Hard Problems (extended abstract),Proceedings of the 26th Annual Allerton Conference on Communication, Control, and Computing, September.
Sloane, N. J. A. (1989), Unsolved Problems in Graph Theory Arising from the Study of Codes,Graph Theory Notes of New York XVIII, 11–20.
Stein, S. K. (1974), Algebraic Tiling,Amer. Math. Monthly 81, 445–462.
Szabó, S. (1986), A Reduction of Keller's Conjecture,Periodica Math. Hung. 17(4), 265–277.
Xue, J. (1991), Fast Algorithms for Vertex Packing and Related Problems, Ph.D. Thesis, GSIA, Carnegie Mellon University.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Hasselberg, J., Pardalos, P.M. & Vairaktarakis, G. Test case generators and computational results for the maximum clique problem. J Glob Optim 3, 463–482 (1993). https://doi.org/10.1007/BF01096415
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01096415