SFU NP Decision Problem Discussion
Description
Choose an NP-Complete decision problem.You may choose any NP-Complete decision problem, but here are some of the morestraightforward ones:
? Clique
? Graph colouring
? Hamiltonian path
? Longest path
? Independent set
? Vertex cover
? Integer programming
? 3-SAT
For the problem you chose:
a. Explain the problem.
b. Outline an algorithm that can solve the problem, either as a simple description or withpseudocode. The algorithm can be simple, e.g. brute force. What is the time complexityof this algorithm?
c. Describe how you could verify that a solution is valid. What is the time complexity ofverifying a solution?
Get your college paper done by experts
Do my questionPlace an order in 3 easy steps. Takes less than 5 mins.
Leave a Reply
Want to join the discussion?Feel free to contribute!