Back to Questions

Computer Science Fundamentals Algorithms Objective

Nov 23, 2012

Let FHAM be the problem of finding a Hamiltonian cycle in a graph G and DHAM be the problem of determining if a Hamiltonial cycle exists in a graph. Which one of the following is TRUE?

Choose the correct answer:

A) Both FHAM and DHAM are NP-hard

B) FHAM is NP hard, but DHAM is not

C) DHAM is NP hard, but FHAM is not

D) Neither FHAM nor DHAM is NP hard

Detailed Explanation

No Explanation

Discussion (0)

No comments yet. Be the first to share your thoughts!

Share Your Thoughts

Feedback