Equivalence between the minimum covering problem and the maximum matching problem (Q1068107): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Q4083324 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4070624 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3270978 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4130999 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3863425 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: An Algorithm for a Minimum Cover of a Graph / rank | |||
Normal rank | |||
Latest revision as of 19:47, 14 June 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
