Q. Hamiltonian path problem is

(A) np problem
(B) n class problem
(C) p class problem
(D) np complete problem

💬 Discuss

✅ Correct Answer: (D) np complete problem

Explanation: hamiltonian path problem is found to be np complete. hamiltonian cycle problem is also an np- complete problem.

Published by Mr. Dubey ⭐ 111.54K Points at 16-Sep-2023 03:44 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey

hamiltonian path problem is found to be np complete. hamiltonian cycle problem is also an np- complete problem.

💬 Discussion

📊 Question Analytics

👁️

533

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

86%

Success Rate