- Computer Science Engineering (CSE)
- Design and Analysis of Algorithms
- Which is the correct technique for findi...

Q. |
## Which is the correct technique for finding a maximum matching in a graph? |

A. | dfs traversal |

B. | bfs traversal |

C. | shortest path traversal |

D. | heap order traversal |

Answer» B. bfs traversal | |

Explanation: the correct technique for finding a maximum matching in a bipartite graph is by using a breadth first search(bfs). |

View all MCQs in:
Design and Analysis of Algorithms

- Maximum matching is also called as maximum cardinality matching.
- From the given graph, how many vertices can be matched using maximum matching in bipartite graph algorithm?
- Which graph has a size of minimum vertex cover equal to maximum matching?
- A k-regular bipartite graph is the one in which degree of each vertices is k for all the vertices in the graph. Given that the bipartitions of this graph are U and V respectively. What is the relation between them?
- Consider a undirected graph G with vertices { A, B, C, D, E}. In graph G, every edge has distinct weight. Edge CD is edge with minimum weight and edge AB is edge with maximum weight. Then, which of the following is false?
- 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?
- The problem of finding a path in a graph that visits every vertex exactly once is called?
- What is the time complexity for finding a Hamiltonian path for a graph having N vertices (using permutation)?
- Which theorem gives the relation between the minimum vertex cover and maximum matching?

Login to Continue

It will take less than 2 minutes

Report MCQ