Una variante del algoritmo de Edmonds para acoplamientos Maximos

DOI10.1007/BF02888459zbMath0729.90501MaRDI QIDQ3354495

Jose Manuel Gutierrez Diez

Publication date: 1983

Published in: Trabajos de Estadistica Y de Investigacion Operativa (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/40703

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Unnamed Item
• Unnamed Item
• Integer Programming: Methods, Uses, Computations
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• Modification of Edmonds' maximum matching algorithm

This page was built for publication: Una variante del algoritmo de Edmonds para acoplamientos Maximos