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 (i.e. no two vertices along the path share a colour).
1. State a decision version of the problem.
2. Show it is in NP.
3. Show it is NP-hard. Conclude it is NP-complete.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Programming Questions!