Which of the following algorithm can be used to solve the Hamiltonian path problem efficiently?
|A.||branch and bound|
|C.||divide and conquer|
|Answer» A. branch and bound|
|Explanation: the hamiltonian path problem can be solved efficiently using branch and bound approach. it can also be solved using a backtracking approach.|
Login to Continue
It will take less than 2 minutes