Q155
Which of the following algorithm can be used to solve the Hamiltonian path problem efficiently?
A.
branch and bound
AnswerB.
iterative improvement
C.
divide and conquer
D.
greedy algorithm
Answer: Option A
Solution
Answer: Option A
No explanation is given for this question Let's Discuss on Board