Classical bipartite cardinality matching: Difference between revisions
Jump to navigation
Jump to search
(Created page with "== Abstract view == '''Algorithmic problem:''' Cardinality-maximal matching in Basic graph definitions#Bipartitions and...") |
|||
| Line 2: | Line 2: | ||
'''Algorithmic problem:''' | '''Algorithmic problem:''' | ||
[[Matchings in graphs#Cardinality-maximal matching|Cardinality-maximal matching]] in [[Basic graph definitions# | [[Matchings in graphs#Cardinality-maximal matching|Cardinality-maximal matching]] in [[Basic graph definitions#Bipartite and k-partite graphs|bipartite graphs]]. | ||
'''Type of algorithm:''' loop. | '''Type of algorithm:''' loop. | ||
Revision as of 13:41, 17 November 2014
Abstract view
Algorithmic problem: Cardinality-maximal matching in bipartite graphs.
Type of algorithm: loop.