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

• Branch and bound
• Iterative improvement
• Divide and conquer
• Greedy algorithm

Submit