In the context of fixed parameter algorithms, which was recently introduced by Downey and Fellows, it would be interesting to design an algorithm with running time where is the size of the maximum clique, is a small constant independent of and is a (exponential) function of . Such an algorithm can work for small even for large .

Contributed by Mohammad Taghi Hajiaghayi

Back to the
main index
for Perfect Graphs.