Unformatted text preview: The latter. Let me further clarify: 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. Tak...
View Full Document
- Spring '10
- Graph Theory, polynomial time algorithm