McqMate

Q. |
## Who was the first person to solve the maximum matching problem? |

A. | jack edmonds |

B. | hopcroft |

C. | karp |

D. | claude berge |

Answer» A. jack edmonds | |

Explanation: jack edmonds was the first person to solve the maximum matching problem in 1965. |

834

0

Do you find this helpful?

6

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- Maximum matching is also called as maximum cardinality matching.
- Given a rod of length n and the selling prices of all pieces smaller than equal to n, find the most beneficial way of cutting the rod into smaller pieces. This problem is called the rod cutting problem. Which of these methods can be used to solve the rod cutting problem?
- You are given infinite coins of N denominations v1, v2, v3,…..,vn and a sum S. The coin change problem is to find the minimum number of coins required to get the sum S. What is the time complexity of a dynamic programming implementation used to solve the coin change problem?
- Given an array, check if the array can be divided into two subsets such that the sum of elements of the two subsets is equal. This is the balanced partition problem. Which of the following methods can be used to solve the balanced partition problem?
- You are given n dice each having f faces. You have to find the number of ways in which a sum of S can be achieved. This is the dice throw problem. Which of the following methods can be used to solve the dice throw problem?
- The longest increasing subsequence problem is a problem to find the length of a subsequence from a sequence of array elements such that the subsequence is sorted in increasing order and it’s length is maximum. This problem can be solved using
- Given a 2D matrix, find a submatrix that has the maximum sum. Which of the following methods can be used to solve this problem?
- Which algorithm is used to solve a maximum flow problem?
- Which graph has a size of minimum vertex cover equal to maximum matching?
- Which theorem gives the relation between the minimum vertex cover and maximum matching?