Q480
What is the time complexity for finding a Hamiltonian path for a graph having N vertices (using permutation)?
A.
O(N!)
B.
O(N! * N)
AnswerC.
O(log N)
D.
O(N)
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board