Exact Algorithms for Maximum Clique: A Computational Study

Prosser, P. (2012) Exact Algorithms for Maximum Clique: A Computational Study. Technical Report. School of Computing Science, University of Glasgow.

Full text not currently available from Enlighten.

Publisher's URL: http://www.dcs.gla.ac.uk/publications/paperdetails.cfm?id=9386

Abstract

The purpose of this paper is to investigate a number of recently reported exact algorithms for the maximum clique problem. The actual program code used is presented and critiqued. The computational study aims to show how implementation details, problem features and hardware platforms influence algorithmic behaviour in those algorithms.

Item Type:Research Reports or Papers (Technical Report)
Additional Information:DCS Tech Report Number: TR-2012-333 Paper ID: 9386 Appeared in: SoCS Technical Report Series
Status:Published
Glasgow Author(s) Enlighten ID:Prosser, Dr Patrick
Authors: Prosser, P.
College/School:College of Science and Engineering > School of Computing Science
Publisher:School of Computing Science, University of Glasgow

University Staff: Request a correction | Enlighten Editors: Update this record