paper "Maximum Matching and a Polyhedron with 0,1-Vertices"
E1739869
UNEXPLORED
"Maximum Matching and a Polyhedron with 0,1-Vertices" is a foundational paper in combinatorial optimization and polyhedral theory that introduced key ideas for solving maximum matching problems using linear programming and polyhedral methods.
All labels observed (1)
| Label | Occurrences |
|---|---|
| paper "Maximum Matching and a Polyhedron with 0,1-Vertices" canonical | 1 |
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.