Vidyalelo
Data Structure · Q702

Miscellaneous on Data Structures

Programming · Data Structure · question 702

Q702

The problem of maximizing the sum of weights on edges connecting matched pairs of vertices is?

A.
Maximum- mass matching
B.
Maximum bipartite matching
C.
Maximum weight matching
Answer
D.
Maximum node matching

Answer: Option C

Solution

Answer: Option C
No explanation is given for this question Let's Discuss on Board