Vidyalelo
Data Structure · Q1035

Miscellaneous on Data Structures

Programming · Data Structure · question 1035

Q1035

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

A.
O(0.251n)
Answer
B.
O(0.401n)
C.
O(0.167n)
D.
O(0.151n)

Answer: Option A

Solution

Answer: Option A
No explanation is given for this question Let's Discuss on Board