Academic Journals Database
Disseminating quality controlled scientific knowledge

Exact Algorithms for Maximum Clique: A Computational Study 

ADD TO MY LIST
 
Author(s): Patrick Prosser

Journal: Algorithms
ISSN 1999-4893

Volume: 5;
Issue: 4;
Start page: 545;
Date: 2012;
Original page

Keywords: maximum clique | exact algorithms | empirical study 

ABSTRACT
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.
RPA Switzerland

RPA Switzerland

Robotic process automation

    

Tango Jona
Tangokurs Rapperswil-Jona