Una variante del algoritmo de Edmonds para acoplamientos Maximos

DOI10.1007/BF02888459MaRDI QIDQ3354495zbMATH OpenFDO

Authors 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

• scientific article; zbMATH DE number 3503127 (Why is no real title available?)
• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• Integer Programming: Methods, Uses, Computations
• Maximum matching and a polyhedron with 0,1-vertices
• Modification of Edmonds' maximum matching algorithm
• Paths, Trees, and Flowers

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3354495)