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
- Spring '10
- Graph Theory, polynomial time algorithm