Question: Suppose we are given a graph G as well as a color cv for each vertex v . The task is to find the longest
Suppose we are given a graph G as well as a color cv for each vertex v The task is to find the longest path in the graph which consists of all different colours ie no two vertices along the path share a colour
State a decision version of the problem.
Show it is in NP
Show it is NPhard. Conclude it is NPcomplete.
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
