Next Article in Journal
An Efficient Algorithm for Automatic Peak Detection in Noisy Periodic and Quasi-Periodic Signals
Next Article in Special Issue
Extracting Co-Occurrence Relations from ZDDs
Previous Article in Journal
Finite Element Quadrature of Regularized Discontinuous and Singular Level Set Functions in 3D Problems
Open AccessArticle

Exact Algorithms for Maximum Clique: A Computational Study

Computing Science, University of Glasgow, Glasgow G12 8QQ, UK
Algorithms 2012, 5(4), 545-587; https://doi.org/10.3390/a5040545
Received: 11 September 2012 / Revised: 29 October 2012 / Accepted: 29 October 2012 / Published: 19 November 2012
(This article belongs to the Special Issue Graph Algorithms)
We investigate a number of recently reported exact algorithms for the maximum clique problem. The program code is presented and analyzed to show how small changes in implementation can have a drastic effect on performance. The computational study demonstrates how problem features and hardware platforms influence algorithm behaviour. The effect of vertex ordering is investigated. One of the algorithms (MCS) is broken into its constituent parts and we discover that one of these parts frequently degrades performance. It is shown that the standard procedure used for rescaling published results (i.e., adjusting run times based on the calibration of a standard program over a set of benchmarks) is unsafe and can lead to incorrect conclusions being drawn from empirical data. View Full-Text
Keywords: maximum clique; exact algorithms; empirical study  maximum clique; exact algorithms; empirical study 
Show Figures

Figure 1

MDPI and ACS Style

Prosser, P. Exact Algorithms for Maximum Clique: A Computational Study . Algorithms 2012, 5, 545-587.

Show more citation formats Show less citations formats

Article Access Map

1
Only visits after 24 November 2015 are recorded.
Back to TopTop