CliSAT: A new exact algorithm for hard maximum clique problems.

Pablo San Segundo Fabio Furini David Álvarez Panos M. Pardalos

Published in: Eur. J. Oper. Res. (2023)

Keyphrases

probabilistic model
pattern recognition
np hard
worst case
matching algorithm
polynomial time approximation
vertex cover