- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- A matching M is maximal if and only if t...

Q. |
## A matching M is maximal if and only if there exists no augmenting path with respect to M. |

A. | true |

B. | false |

Answer» A. true | |

Explanation: according to the theorem discovered by the french mathematician claude berge, it means that the current matching is maximal if there is no augmenting path. |

View all MCQs in:
Design and Analysis of Algorithms

- What is the length of an augmenting path?
- Maximum matching is also called as maximum cardinality matching.
- A simple acyclic path between source and sink which pass through only positive weighted edges is called?
- There is no existing relationship between a Hamiltonian path problem and Hamiltonian circuit problem.
- Which theorem gives the relation between the minimum vertex cover and maximum matching?
- Which graph has a size of minimum vertex cover equal to maximum matching?
- is a matching with the largest number of edges.
- 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?
- Which one of the following is an application for matching?

Login to Continue

It will take less than 2 minutes

Report MCQ