This preview shows page 1. Sign up to view the full content.
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 SPAN2 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
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íoBío.
 Spring '10
 Chan

Click to edit the document details