![NP-complete problems / Graph coloring / Independent set / NP-complete / Clique / Vertex cover / NP / Clique cover problem / Domatic number / Theoretical computer science / Graph theory / Computational complexity theory NP-complete problems / Graph coloring / Independent set / NP-complete / Clique / Vertex cover / NP / Clique cover problem / Domatic number / Theoretical computer science / Graph theory / Computational complexity theory](https://www.pdfsearch.io/img/e2a9f8462596096d6faf438663d2b3f8.jpg) Date: 2008-09-19 00:58:50NP-complete problems Graph coloring Independent set NP-complete Clique Vertex cover NP Clique cover problem Domatic number Theoretical computer science Graph theory Computational complexity theory | | CS109B Notes for LectureNP-Complete Problems We have met some problems that have \easy" solutions; they have algorithms that run in time that is polynomial in the size of the graph, the parameter m. Examples: Add to Reading ListSource URL: infolab.stanford.eduDownload Document from Source Website File Size: 56,61 KBShare Document on Facebook
|