A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities (Q4896435)
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: A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities |
scientific article; zbMATH DE number 937186
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities |
scientific article; zbMATH DE number 937186 |
Statements
A Staged Primal-Dual Algorithm for Perfect b-Matching with Edge Capacities (English)
0 references
20 October 1996
0 references
minimum cost perfect \(b\)-matching
0 references
weighted undirected graph
0 references
frozen supervertices
0 references
0.874798059463501
0 references
0.8016245365142822
0 references
0.7933893799781799
0 references
