NP-Completeness question (introduction to algorithms)
Show that if Ham-Cycle is an element of P then the problem offinding a solution (which is a permutation of the vertices thatforms the simple cycle) is polynomial time solvable.
Expert Answer
An answer will be send to you shortly. . . . .