An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs

The Art of Computer Programming

1968 • 16,727 citations

Graph theory

1969 • 11,244 citations

Paths, Trees, and Flowers

1965 • 2,165 citations

Maximum matching and a polyhedron with 0,1-vertices

1965 • 1,719 citations

Paths, Trees, and Flowers

2009 • 1,627 citations

Efficiency of a Good But Not Linear Set Union Algorithm

1975 • 1,348 citations

Optimal scheduling for two-processor systems

1972 • 605 citations

TWO THEOREMS IN GRAPH THEORY

1957 • 565 citations

Implementation of algorithms for maximum matching on nonbipartite graphs.

1974 • 203 citations

Optimal Sequencing of Two Equivalent Processors

1969 • 184 citations

Modification of Edmonds' maximum matching algorithm

1965 • 34 citations

An efficient planarity algorithm

1972 • 33 citations

An efficient implementation of Edmonds'' maximum matching algorithm.

1972 • 13 citations