A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph (Q4291501)
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 Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph |
scientific article; zbMATH DE number 566390
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph |
scientific article; zbMATH DE number 566390 |
Statements
A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph (English)
0 references
10 May 1994
0 references
minimum cost perfect two-matching
0 references
weighted undirected graph
0 references
network flow algorithm
0 references
