An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs (Q5682014)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs |
scientific article; zbMATH DE number 3419167
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs |
scientific article; zbMATH DE number 3419167 |
Statements
An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs (English)
0 references
1973
0 references
