Concepedia

Edmonds polytopes and a hierarchy of combinatorial problems

Vašek Chvátal

Discrete Mathematics · 1973 · 619 citations · 19 references

DOI

Concepts

References

19

The complexity of theorem-proving procedures

Stephen Cook · 1971 · 6.2K citations · Full text

, , +17

An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs

John E. Hopcroft, Richard M. Karp · SIAM Journal on Computing · 1973 · 2.8K citations

, , +15

Paths, Trees, and Flowers

Jack Edmonds · Canadian Journal of Mathematics · 1965 · 2.4K citations · Full text

, , +16

Maximum matching and a polyhedron with 0,1-vertices

Jack Edmonds · Journal of Research of the National Bureau of Standards Section B Mathematics and Mathematical Physics · 1965 · 1.7K citations · Full text

, , +8

Outline of an algorithm for integer solutions to linear programs

Ralph E. Gomory · Bulletin of the American Mathematical Society · 1958 · 1.4K citations · Full text

, , +9