M

Mr. Dubey • 97.30K Points
Coach

Q. Which of the following algorithm can be used to solve the Hamiltonian path problem efficiently?

  • (A) branch and bound
  • (B) iterative improvement
  • (C) divide and conquer
  • (D) greedy algorithm
Share

Explanation by: Mr. Dubey
the hamiltonian path problem can be solved efficiently using branch and bound approach. it can also be solved using a backtracking approach.

You must be Logged in to update hint/solution

Discusssion

Login to discuss.

Loading Comments....

Question analytics