Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs (Q2795749)
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: Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs |
scientific article; zbMATH DE number 6559383
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs |
scientific article; zbMATH DE number 6559383 |
Statements
Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs (English)
0 references
22 March 2016
0 references
complexity
0 references
auction algorithm
0 references
pushrelabel algorithm
0 references
bipartite matching
0 references
random graphs
0 references
0 references
0.88361996
0 references
0.8651111
0 references
0.8640899
0 references
0.8571532
0 references
0.8570424
0 references
0.8563376
0 references
0.8558717
0 references
0.8558717
0 references
0.8551605
0 references
