Perfect matching

From Ref
Revision as of 14:35, 9 June 2008 by Vipul (talk | contribs) (New page: <noinclude> </noinclude> '''Perfect matching''': A matching in a bipartite graph such that every element on one side gets matched to ...)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)


Perfect matching: A matching in a bipartite graph such that every element on one side gets matched to exactly one element on the other side.

No relevant subject wiki entry.