Concepedia

On complexity of special maximum matchings constructing

Rafayel R. Kamalian, Vahan Mkrtchyan

Discrete Mathematics · 2007 · 12 citations · 23 references

DOIFull text

Open access

Concepts

References

23

The Hungarian method for the assignment problem

Harold W. Kuhn · Naval Research Logistics Quarterly · 1955 · 12.6K citations

, , +9

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

Some simplified NP-complete graph problems

M. R. Garey, David S. Johnson, Larry Stockmeyer · Theoretical Computer Science · 1976 · 2.1K citations

, , +11

Introduction to graph theory

Kathryn Fraughnaugh · Networks · 1997 · 1.7K citations

, , +10