Computing clique and chromatic number of circular-perfect graphs in polynomial time.

Arnaud Pêcher Annegret Katrin Wagler

Published in: Math. Program. (2013)

Keyphrases

computational complexity
np hard
small number
maximum number
data sets
color images
human perception
graph representation
random graphs