Planar Bipartite Graph Perfect 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.

28 April 2023

10 April 2023

15 February 2023

  • curprev 10:2010:20, 15 February 2023‎ Admin talk contribs‎ 1,608 bytes +1,608‎ Created page with "{{DISPLAYTITLE:Planar Bipartite Graph Perfect Matching (Maximum Cardinality Matching)}} == Description == The goal of maximum cardinality matching is to find a matching with as many edges as possible (equivalently: a matching that covers as many vertices as possible). Here, the graph is a planar bipartite graph. == Related Problems == Generalizations: Bipartite Graph MCM Related: General Graph MCM == Parameters == <pre>V: number of vertices E: number of..."
Retrieved from "https://algorithm-wiki-csail-mit-edu.ezproxy.canberra.edu.au/wiki/Planar_Bipartite_Graph_Perfect_Matching"