|
|||||
|
|
Equivalence between the minimum covering problem and the maximum matching problem |
|
| Authors: | Ján Plesník |
| Affiliation: | Matematicko-fyzikálna fakulta UK, 842 15 Bratislava, Czechoslovakia |
| Abstract: | The minimum covering problem in weighted graphs with n vertices is transformed in time O(n2) to the maximum matching problem with n or n + 1 vertices, and conversely. |
| Keywords: | |
| 本文献已被 ScienceDirect 等数据库收录！ | |