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