1.

For which of the following, greedy algorithm finds a minimal vertex cover in polynomial time?

A. tree graphs
B. bipartite graphs
C. both (a) and (b)
D. none of the mentioned
Answer» B. bipartite graphs


Discussion

No Comment Found

Related MCQs