An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs (Q5682014): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0202019 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2157529519 / rank | |||
Normal rank | |||
Latest revision as of 23:01, 19 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
