1.

For which of the following, greedy algorithm finds a minimal vertex cover in polynomial time?a) tree graphsb) bipartite graphsc) both (

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


Discussion

No Comment Found

Related MCQs