Equivalence between the minimum covering problem and the maximum matching problem (Q1068107)
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: Equivalence between the minimum covering problem and the maximum matching problem |
scientific article; zbMATH DE number 3929053
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence between the minimum covering problem and the maximum matching problem |
scientific article; zbMATH DE number 3929053 |
Statements
Equivalence between the minimum covering problem and the maximum matching problem (English)
0 references
1984
0 references
The minimum covering problem in weighted graphs with n vertices is transformed in time \(O(n^ 2)\) to the maximum matching problem with n or \(n+1\) vertices, and conversely.
0 references
minimum covering problem
0 references
maximum matching problem
0 references
0 references
0.8753224
0 references
0.87369674
0 references
0.87368035
0 references
0.8733808
0 references
0.87148184
0 references
0.86972374
0 references
