The minimal cost maximum matching of a graph

DOI10.1007/BF01939827zbMath0231.90055OpenAlexW2029684731MaRDI QIDQ5639540

C. A. Roveda, A. O. de Maio

Publication date: 1971

Published in: Unternehmensforschung Operations Research - Recherche Opérationnelle (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01939827

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An Algorithm for a Minimum Cover of a Graph
• An Automatic Method of Solving Discrete Programming Problems
• Maximum matching and a polyhedron with 0,1-vertices

This page was built for publication: The minimal cost maximum matching of a graph