Complexity of clique-coloring odd-hole-free graphs.

David Défossez

Published in: J. Graph Theory (2009)

Keyphrases

worst case
maximum clique
graph properties
graph matching
data sets
similarity measure
weighted graph
independent set
computational complexity
graph mining
graph model
space complexity
graph partitioning
polynomial time complexity