Abstract

AbstractThis article introduces the closely related maximum clique, maximum independent set, graph coloring, and minimum clique partitioning problems. The survey includes some of the most important results concerning these problems, including their computational complexity, known bounds, mathematical programming formulations, and exact and heuristic algorithms to solve them.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call