問題詳情
【題組】(56) Which of the followings is wrong?
(A) If a spanning tree has the maximum degree as 2, then it is a Hamiltonian path.
(B)If Problem III can be solved in polynomial time, then we can find a Hamiltonian path in polynomial time.
(C) Problem I can be solved with the Prim's algorithm..
(D) A graph can have more than one spanning tree.
(E) If P=NP, then Problem II can be solved in polynomial time.
參考答案
答案：[無官方正解]
難度：計算中-1
書單：沒有書單，新增