An algorithm for min-cost edge-disjoint cycles and its applications (Q1200787)
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: An algorithm for min-cost edge-disjoint cycles and its applications |
scientific article; zbMATH DE number 95789
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for min-cost edge-disjoint cycles and its applications |
scientific article; zbMATH DE number 95789 |
Statements
An algorithm for min-cost edge-disjoint cycles and its applications (English)
0 references
16 January 1993
0 references
maximum cut
0 references
negative costs
0 references
edge-disjoint cycles
0 references
weighted undirected graph
0 references
chinese postman problem
0 references
max-weight matching
0 references
planar graphs
0 references
