Q288
The greedy algorithm can find a minimal vertex cover in polynomial time for which among the following?
A.
Tree graphs
B.
Bipartite graphs
AnswerC.
Hypercube
D.
Clique graphs
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board