Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem (Q1337676)
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: Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem |
scientific article; zbMATH DE number 683682
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem |
scientific article; zbMATH DE number 683682 |
Statements
Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem (English)
0 references
8 November 1994
0 references
bipartite graph
0 references
bottleneck bipartite matching problem
0 references
maximum cardinality matching
0 references
worst-case complexity
0 references
0 references
