Matchings in node-weighted convex bipartite graphs (Q2901005)
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: Matchings in node-weighted convex bipartite graphs |
scientific article; zbMATH DE number 6060373
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Matchings in node-weighted convex bipartite graphs |
scientific article; zbMATH DE number 6060373 |
Statements
28 July 2012
0 references
algorithms
0 references
graphs matching
0 references
scheduling
0 references
perfect matching
0 references
Matchings in node-weighted convex bipartite graphs (English)
0 references
0.8366419672966003
0 references
0.8255053162574768
0 references
0.8020229935646057
0 references
0.7975054979324341
0 references
