Solving matching problems efficiently in bipartite graphs (Q2946048)
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 6482465
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Solving matching problems efficiently in bipartite graphs |
scientific article; zbMATH DE number 6482465 |
Statements
Solving Matching Problems Efficiently in Bipartite Graphs (English)
0 references
15 September 2015
0 references
0 references
0.8081055283546448
0 references
0.7981157898902893
0 references
0.7981157898902893
0 references
0.7956574559211731
0 references
