McqMate

Q. |
## is a matching with the largest number of edges. |

A. | maximum bipartite matching |

B. | non-bipartite matching |

C. | stable marriage |

D. | simplex |

Answer» A. maximum bipartite matching | |

Explanation: maximum bipartite matching matches two elements with a property that no two edges share a vertex. |

1.4k

0

Do you find this helpful?

2

View all MCQs in

Design and Analysis of AlgorithmsNo comments yet

- Maximum matching is also called as maximum cardinality matching.
- A complete bipartite graph is a one in which each vertex in set X has an edge with set Y. Let n be the total number of vertices. For maximum number of edges, the total number of vertices hat should be present on set X is?
- A graph has 20 vertices. The maximum number of edges it can have is? (Given it is bipartite)
- 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?
- 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?
- 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?
- Which is the correct technique for finding a maximum matching in a graph?