This preview shows page 1. Sign up to view the full content.
Unformatted text preview: assume that you can associate a numeric value with a node, rather than just indicate whether it has been marked or not. Also, recall that a simple path is a path without any repeated nodes. 8. Problem 7.20 (b), p. 296. Note that UHAMPATH is the following language: UHAMPATH = {<G, s, t>  G is an undirected graph with a Hamiltonian path from s to t} You are again dealing with simple paths in this problem. Our Final Exam is Friday, June 4 in Hewlett 201 and 420041. Room assignments will be announced....
View
Full
Document
This document was uploaded on 02/08/2011.
 Fall '09

Click to edit the document details