Equivalence between the minimum covering problem and the maximum matching problem (Q1068107): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 01:02, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Equivalence between the minimum covering problem and the maximum matching problem |
scientific article |
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
