M

Mr. Dubey • 52.30K Points
Coach 

Q. 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) bipartite matching
(B) cardinality matching
(C) augmenting
(D) weight matching
Correct : Option (C)

Explanation: 
 a simple path from a free vertex in v to a free vertex in u whose edges alternate between edges not in m and edges in m is called a augmenting path.

Share

Discusssion

Login to discuss.

Be the first to start discuss.

Related MCQs

Q. The file organization which allows us to read records that would satisfy the join condition by using one block read is

Q. Which one of the following is a real time operating system?

Q. Data integrity constraints are used to:

Q. The file organization that provides very fast access to any arbitrary record of a file is:

Q. Co-ordination is considered to be the essence of management because

Q. is a CPU emulator and virtual machine monitor

Q. If A and B are two fuzzy sets with membership functions μA(x) = {0.6, 0.5, 0.1, 0.7, 0.8} μB(x) = {0.9, 0.2, 0.6, 0.8, 0.5} Then the value of &m

Q. Bug status is set to postpone due to _.

Q. Which question corresponds best to the following query? SELECT CID, CDUR - 1,' = PRICE' FROM COURSES ORDER BY 2

Q. Direction is a ________ function performed by all the managers at all levels of the organization.