For which of the following, greedy algorithm finds a minimal vertex cover in polynomial time?
Posted: Thu Jul 14, 2022 9:26 am
a) tree graphs
b) bipartite graphs
c) all of the mentioned
d) none of the mentioned
b) bipartite graphs
c) all of the mentioned
d) none of the mentioned