Q. For a graph of degree three, in what time can a Hamiltonian path be found?

(A) o(0.251n)
(B) o(0.401n)
(C) o(0.167n)
(D) o(0.151n)

💬 Discuss

✅ Correct Answer: (A) o(0.251n)

Explanation: for a graph of maximum degree three, a hamiltonian path can be found in time o(0.251n).

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

Explanation by: Mr. Dubey

for a graph of maximum degree three, a hamiltonian path can be found in time o(0.251n).

💬 Discussion

📊 Question Analytics

👁️

650

Total Visits

📽️

3 y ago

Published

🎖️

Mr. Dubey

Publisher

📈

85%

Success Rate