Question: Suppose that there is a polynomial time algorithm to decide Is there is a path P that visits each vertex of the graph once

Suppose that there is a polynomial time algorithm to decide "Is there is a path P that visits each vertex of the graph once where Ledge eep We W" for integer weights we and integer W. Devise a polynomial time algorithm which computes the minimal possible value for W for which there is a path visiting each vertex once where the sum of edge weights is W.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
