This preview shows page 1. Sign up to view the full content.
Unformatted text preview: G represent an undirected graph. Also let SPATH = { a G, a, b, k A  G contains a simple path of length at most k from a to b } and LPATH = { a G, a, b, k A  G contains a simple path of length at least k from a to b } . (a) Show that SPATH P. (b) Show that LPATH is NPComplete. You may assume the NPcompleteness of UHAMPATH , the Hamiltonian path problem for undirected graphs. 1...
View Full
Document
 Fall '10
 Nakayama
 Computer Science

Click to edit the document details