Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem (Q1337676): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 13:15, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem |
scientific article |
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
