# Answer to Question #23186 in Quantitative Methods for Sujata Roy

Question #23186

Which of the following problems can be solved by a standard greedy algorithm?

I. Finding a minimum spanning tree in an undirected graph with positive-integer edge weights

II. Finding a maximum clique in an undirected graph

III. Finding a maximum flow from a source node to a sink node in a directed graph with positive-integer edge

capacities

(A) I only (B) II only (C) III only (D) I and II only (E) I, II, and III

I. Finding a minimum spanning tree in an undirected graph with positive-integer edge weights

II. Finding a maximum clique in an undirected graph

III. Finding a maximum flow from a source node to a sink node in a directed graph with positive-integer edge

capacities

(A) I only (B) II only (C) III only (D) I and II only (E) I, II, and III

Expert's answer

#### Not answered

Need a fast expert's response?

Submit orderand get a quick answer at the best price

for any assignment or question with DETAILED EXPLANATIONS!

## Comments

## Leave a comment