Finding a maximum k-club using the k-clique formulation and canonical hypercube cuts.

Esmaeel Moradi Balabhaskar Balasundaram

Published in: Optim. Lett. (2018)

Keyphrases

parallel algorithm
database
set theoretic
maximum clique
data mining
feature selection
probabilistic formulation