Exact Algorithms for Maximum Clique: A Computational Study
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 platfo...
Main Author: | Patrick Prosser |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2012-11-01
|
Series: | Algorithms |
Subjects: | |
Online Access: | http://www.mdpi.com/1999-4893/5/4/545 |
Similar Items
-
NK-MaxClique and MMCQ: Tow New Exact Branch and Bound Algorithms for the Maximum Clique Problem
by: Neda Mohammadi, et al.
Published: (2020-01-01) -
The Use of an Exact Algorithm within a Tabu Search Maximum Clique Algorithm
by: Derek H. Smith, et al.
Published: (2020-10-01) -
Quantum Algorithm for Finding a Maximum Clique in an Undirected Graph
by: Alan Bojić
Published: (2012-12-01) -
Exact Maximum Clique Algorithm for Different Graph Types Using Machine Learning
by: Kristjan Reba, et al.
Published: (2021-12-01) -
MEAMCP: A Membrane Evolutionary Algorithm for Solving Maximum Clique Problem
by: Ping Guo, et al.
Published: (2019-01-01)