Q. Which theorem gives the relation between the minimum vertex cover and maximum matching?

  • (A) konig’s theorem
  • (B) kirchhoff’s theorem
  • (C) kuratowski’s theorem
  • (D) kelmans theorem
💬 Discuss
✅ Correct Answer: (A) konig’s theorem
Explanation: the konig’s theorem given the equivalence relation between the minimum vertex cover and the maximum matching in graph theory. bipartite graph has a size of minimum vertex cover equal to maximum matching.

Published by Mr. Dubey ⭐ 111.42K Points at 16-Sep-2023 03:44 pm in Design and Analysis of Algorithms

Explanation by: Mr. Dubey
the konig’s theorem given the equivalence relation between the minimum vertex cover and the maximum matching in graph theory. bipartite graph has a size of minimum vertex cover equal to maximum matching.

💬 Discussion

Related MCQs

Q. Why is Global.asax is used?

Q. Which of the following is a valid SQL data type?

Q. There is a set of page replacement algorithms that can never exhibit Belady’s Anomaly, called

Q. ………. helps management to evaluate alternative course of action for selecting the best course of action

Q. VHDL is very strict in the way it allows us to assign and compare such as signals, variables, constants, and literals.

Q. A mashup cloud can be designed by utilizing the Scalability of AWS and of GAE platforms

Q. Which model can be selected if user is involved in all the phases of SDLC?

Q. Which of these data models is an extension of the relational data model?

Q. Which of the following tool is used for measuring I/O of your systems to estimate these transaction costs?

Q. In reverse engineering process, what refers to the sophistication of the design information that can be extracted from the source code?

📊 Question Analytics

👁️
761
Total Visits
📽️
3 y ago
Published
🎖️
Mr. Dubey
Publisher
📈
81%
Success Rate