Maximum cardinality matching: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    10 October 2022

    • curprev 10:5910:59, 10 October 2022‎ Admin talk contribs‎ 2,467 bytes +2,467‎ Created page with "== Problem Description== A graph is bipartite if it has two kinds of nodes and the edges are only allowed between nodes of different kind. We write G=(A,B,E) where A and B are the two sets of nodes and E are the edges of G. A matching in a bipartite graph assigns nodes of A to nodes of B. Matchings in bipartite graphs can be computed more efficiently than matchings in general (=non-bipartite) graphs. Interesting Fact: In a bipartite graph the maximum cardinality of a m..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Maximum_cardinality_matching"