450 views
0 votes
0 votes
Which of the following problems can be solved by a standard Greedy algorithm ?

 

I. Finding a minimum cost spanning tree in an undirected graph.

II. Finding a maximum clique in a graph.

III. Finding a maximum flow from a source node to a sink node in a directed graph.

A.I, II

B.I,II,III

C.III only

D.I only

Please log in or register to answer this question.

Related questions

1 votes
1 votes
0 answers
1
Abhijeet_Kumar asked Dec 28, 2017
166 views
0 votes
0 votes
1 answer
2
Smriti012 asked Feb 3, 2017
700 views
Best algorithm for this set:1.Independently sorting each of 1,000,000 arrays, each with 5 elements.2.Sorting a set of 4,000,000 numbers in worst case O(n lg n) time.
2 votes
2 votes
1 answer
3
Deepak Yadav asked Jan 6, 2017
443 views
Solve this problem?
2 votes
2 votes
0 answers
4
Deepak Yadav asked Jan 5, 2017
320 views
How to solve this time complexity question?