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.