Login / Signup
Complexity of colouring problems restricted to unichord-free and \{square, unichord\}-free graphs.
Raphael C. S. Machado
Celina M. H. de Figueiredo
Nicolas Trotignon
Published in:
CoRR (2013)
Keyphrases
</>
related problems
computational complexity
decision problems
benchmark problems
genetic algorithm
case study
image segmentation
reinforcement learning
search algorithm
pattern recognition
computational cost
worst case
optimization problems
np hardness