- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Maximum matching is also called as maxim...

Q. |
## Maximum matching is also called as maximum cardinality matching. |

A. | true |

B. | false |

Answer» A. true | |

Explanation: maximum matching is also called as maximum cardinality matching (i.e.) matching with the largest number of edges. |

View all MCQs in:
Design and Analysis of Algorithms

- 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?
- Which is the correct technique for finding a maximum matching in a graph?
- Who was the first person to solve the maximum matching problem?
- From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
- A matching that matches all the vertices of a graph is called?
- In a bipartite graph G=(V,U,E), the matching of a free vertex in V to a free vertex in U is called?
- is a matching with the largest number of edges.
- A matching M is maximal if and only if there exists no augmenting path with respect to M.
- Which one of the following is an application for matching?

Login to Continue

It will take less than 2 minutes

Report MCQ