An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs (Q5682014): Difference between revisions
From MaRDI portal
Set profile property. |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 05:32, 7 March 2024
scientific article; zbMATH DE number 3419167
| Language | Label | Description | Also known as |
|---|---|---|---|
| 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
