Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) (Q751274)
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: Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) |
scientific article; zbMATH DE number 4176448
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) |
scientific article; zbMATH DE number 4176448 |
Statements
Computing a maximum cardinality matching in a bipartite graph in time \(O(n^{1,5}\sqrt{m/\log \,n})\) (English)
0 references
1991
0 references
analysis of algorithms
0 references
matching
0 references
bipartite graph
0 references
