006 - >>The latter. Let me further clarify: >No....

Info iconThis preview shows page 1. Sign up to view the full content.

View Full Document Right Arrow Icon
Posted on 14 April 2009 09:49 >>>I want to ask in Q3, We have to prove "3D <=p CNFSAT" or "CNFSAT <=p 3D"? >>Q3 asks for a polynomial time algorithm to reduce 3D matching to CNFSAT. The other direction can be found in most textbooks, you are welcome to read it. >so is which one? I cannot understand since the notes uses "is reductible to". Q3 asks for a polynomial time algorithm to illustrate that 3D matching is reducible to CNFSAT. >>>Also, in Q4, I want to ask span-2 tree means "a node with at most 2 degree in graph" or >>>"a node with at most 2 degree in tree which means a node have at most 2 children"?
Background image of page 1
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: >>The latter. Let me further clarify: >No. Degree 2 means 2 neighbors (no matter what they are). As mentioned earlier, G is undirected and its spanning tree is unrooted. >>>Note that G as well as any of its spanning tree are undirected >>>graphs. >>The problem SPAN-2 asks for a spanning tree T such that every node u of T has at most 2 >>neighbors. Note that a node u in the original >>graph G might have 2 or more neighbors. >What is the input parameter g ? The input to the Clique problem has two parts: a graph and a parameter g, we want to find a clique of size g. Tak...
View Full Document

This note was uploaded on 03/01/2010 for the course CS 1234 taught by Professor Chan during the Spring '10 term at University of the Bío-Bío.

Ask a homework question - tutors are online