Branch and bound algorithms for the maximum clique problem under a unified framework
2012
In this paper we review branch and bound-based algorithms proposed for the exact solution of the maximum clique problem and describe them under a unifying conceptual framework. As a proof of concept, we actually implemented eight of these algorithms as parametrized versions of one single general branch and bound algorithm.
Keywords:
- Correction
- Source
- Cite
- Save
- Machine Reading By IdeaReader
20
References
20
Citations
NaN
KQI