tailieunhanh - Lecture Design and Analysis of Algorithms: Lecture 45 - Dr. Sohail Aslam

It is well known that planar graphs can be colored (maps) with four colors. There exists a polynomial time algorithm for this. But determining whether this can be done with 3 colors is hard and there is no polynomial time algorithm for it. In this lecture, you find clear explanations of Clique Cover. |