Maximum matching and a polyhedron with 0,1-vertices
Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical PhysicsPublished 1 January 1965Open access
Jack Edmonds
Citations1,723
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
The emphasis in this paper is on relating the matching problem to the theory of continuous linear programming, and the algorithm described does not involve any "blind-alley programming" -which, essentially, amounts to testing a great many combinations.
Abstract
(Dece mbe
Keywords
Computer ScienceMathematics
Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical PhysicsModification of Edmonds' maximum matching algorithm
34 Citations1965Christoph Witzgall, C. T. Zahn
The modificati on presente d in thi s paper avoids s hrinking, and the possibili t y of s uc h an arrangement is also of theo re ti ca l int e res t, and it s proof form s the main part of th e paper-