Paths, Trees, and Flowers
Birkhäuser Boston eBooksPublished 1 January 2009
Jack Edmonds
Citations1,524
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.
Abstract
A graph G for purposes here is a finite set of elements called vertices and a finite set of elements called edges such that each edge meets exactly two vertices, called the end-points of the edge. An edge is said to join its end-points.
Flows in networks
4,080 Citations1962D. R. Ford, D. R. Fulkerson
Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical PhysicsMaximum matching and a polyhedron with 0,1-vertices
1,723 Citations1965Jack Edmonds
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.
EconometricaThe Theory of Graphs and Its Applications
912 Citations1965Elizna Burger, Claude Berge +1 more
Proceedings of the National Academy of SciencesTWO THEOREMS IN GRAPH THEORY
574 Citations1957Claude Berge
Proceedings of the American Mathematical SocietyAn algorithm for a minimum cover of a graph
115 Citations1959Robert Z. Norman, Michael O. Rabin
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-