In what time can the Hamiltonian path problem can be solved using dynamic programming?
|B.||o(n log n)|
|Answer» D. o(n2 2n)|
|Explanation: using dynamic programming, the time taken to solve the hamiltonian path problem is mathematically found to be o(n2 2n).|
Login to Continue
It will take less than 2 minutes