A Staged Primal-Dual Algorithm for Finding a Minimum Cost Perfect Two-Matching in an Undirected Graph (Q4291501): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 18:58, 6 February 2024
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
