The uniquely solvable bipartite matching problem (Q1178733)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 22310
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The uniquely solvable bipartite matching problem |
scientific article; zbMATH DE number 22310 |
Statements
The uniquely solvable bipartite matching problem (English)
0 references
26 June 1992
0 references
linear time algorithm
0 references
bipartite cardinality matching
0 references
bipartite graphs
0 references
unique maximum matching
0 references
0.9558936
0 references
0.9076355
0 references
0.89658237
0 references
0.8901103
0 references
0.8877003
0 references
0.8866129
0 references
0.88416076
0 references
0.8784013
0 references
0.8774097
0 references
0.87567514
0 references
