Search found 1 match

Go to advanced search

by gajaykrishnan
Thu Oct 22, 2009 7:06 am
Forum: Algorithms
Topic: Suggestions required on NP Complete Problem
Replies: 3
Views: 3102

Re: Suggestions required on NP Complete Problem

Well you can do this by reducing HAMCYCLE to your problem.
Adding a restriction of k=|V|, your problem is equivalent to deciding for HAMCYCLE. Since the restricted version is already known to be NP-complete, the unrestricted version (your problem) is also NP-complete.
I hope you can flush out this ...

Go to advanced search