✦ LIBER ✦

Testing for equality between maximum matching and minimum node covering

✍ Scribed by Fǎnicǎ Gavril

Book ID: 113161935
Publisher: Elsevier Science
Year: 1977
Tongue: English
Weight: 451 KB
Volume: 6
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(77)90068-0

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Equivalence between the minimum covering

Equivalence between the minimum covering problem and the maximum matching problem

✍ 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.