Maximum Matching and a Polyhedron With O,1-Vertices1. Jack Edmonds. (December I, 1964). A matching in a graph C is a subset of edges in C such that no two ...
確定! 回上一頁