Equivalence between the minimum covering
β
JΓ‘n PlesnΓk
π
Article
π
1984
π
Elsevier Science
π
English
β 127 KB
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.