Closing Complexity Gaps for Coloring Problems on H-Free Graphs.

Petr A. Golovach Daniël Paulusma Jian Song

Published in: ISAAC (2012)

Keyphrases

decision problems
computational issues
optimization problems
solving problems
polynomial hierarchy
genetic algorithm
clustering algorithm
image segmentation
high dimensional
probabilistic model
worst case
directed graph
graph theory
morphological operators
graph theoretic