Juláan Aráoz

  • Citations Per Year
Learn More
The matching polyhedron theorem of Edmonds and Johnson, which gives the convex hull of capacitated perfect b-matchings of a bidirected graph, is proved by reducing this matching problem to the ordinary perfect 1-matching problem, for which there exists a short inductive proof of the corresponding polyhedral theorem. The proof method makes it possible t o(More)
  • 1