COT_6410_Homework_2 - COT 6410 Homework #2. Due next...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
COT 6410 Homework #2. Due next Tuesday in class (June 5, 2007) Consider the following decision problem: Disjoint Clique Cover (DCC) Given: a graph G = (V, E) and an integer K. Question: Can V be partitioned into k ≤ K sets, V 1 , V 2 , …, V k where each set forms a complete subgraph in G? Find (and demonstrate the validity of) a decision problem π for which there is a polynomial transformation to, and from, DCC. {Hint: we have seen this problem.} Solution: Use the Graph k-Colorability Problem. Graph K-Color Problem (COL) Given: a graph G and in integer k. Question: Can G be properly colored using at most k colors? "properly" means the end points of each edge in G must have a different color. COL DCC 1) Construct the instance of DCC from an arbitrary instance of COL. Let (G, k) be an arbitrary instance I COL of COL. Construct the complement graph G' of G and let the k of DCC be the k of COL. Thus, the constructed instance f(I COL ) = I DCC of DCC is (G', k). Since this takes order the number of edges of G
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 07/14/2011 for the course COT 4610 taught by Professor Dutton during the Fall '10 term at University of Central Florida.

Page1 / 2

COT_6410_Homework_2 - COT 6410 Homework #2. Due next...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online