Equivalence between the minimum covering problem and the maximum matching problem

DOI10.1016/0012-365X(84)90170-5zbMath0581.05045MaRDI QIDQ1068107

Ján Plesník

Publication date: 1984

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

maximum matching problemminimum covering problem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (7)

A parameterized perspective on packing paths of length two ⋮ Edge covering problem under hybrid uncertain environments ⋮ Exact algorithms for edge domination ⋮ Parameterized measure \& conquer for problems with no small kernels ⋮ Parameterized algorithms for \(d\)-hitting set: the weighted case ⋮ Fuzzy minimum weight edge covering problem ⋮ Constrained weighted matchings and edge coverings in graphs

Cites Work

• An Algorithm for a Minimum Cover of a Graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Equivalence between the minimum covering problem and the maximum matching problem