A

Admin • 831.35K Points
Coach

Q. 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)
Explanation by: Admin
using dynamic programming, the time taken to solve the hamiltonian path problem is mathematically found to be o(n2 2n).

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Be the first to start discuss.