Q99
In what time can the Hamiltonian path problem can be solved using dynamic programming?
A.
O(N)
B.
O(N log N)
C.
O(N2)
D.
O(N2 2N)
AnswerAnswer: Option D
Solution
Answer: Option D
No explanation is given for this question Let's Discuss on Board