# Encyclopedia of Operations Research and Management Science

2001 Edition
| Editors: Saul I. Gass, Carl M. Harris

# Matching

Reference work entry
DOI: https://doi.org/10.1007/1-4020-0611-X_589

Matching problems form an important branch of graphtheory. They are of particular interest because of their application to problems found in Operations Research. Matching problems also form a class of integer linear programming problems which can be solved in polynomial time. A good description of the historical development of matching problems and their solutions is contained in the preface of Lovasz and Plummer (1986).

Given a simple non-directed graph G = [V, E] (where E is a set of edges), then a matching is defined as a subset of edges M such that no two edges of M are adjacent. A matching is said to span a set of vertices X in G if every vertex in X is incident with an edge of the matching. A perfect matching is a matching which spans V. A maximum matching is a matching of maximum cardinality, i.e. a matching with the maximum number of members in the set.

A graph is called a bipartite graph if the set of vertices V is the disjoint union of sets V1 and V2 and every edge in Ehas...

This is a preview of subscription content, log in to check access.

## References

1. 
Ball, M.O. and Derigs, U. (1983). “An Analysis of Alternate Strategies for Implementing Matching Algorithms,” Networks 13, 517–549.Google Scholar
2. 
Coffman, E.G., Jr. and Graham, R.L. (1972). “Optimal Scheduling for Two Processor Systems,” Acta Inform. 1, 200–213.Google Scholar
3. 
Derigs, U. and Metz, A. (1986). “On the Use of Optimal Fractional Matchings for Solving the (Integer) Matching Problem,” Computing, 36, 263–270.Google Scholar
4. 
Edmonds, J. (1965a). “Paths, Trees, and Flowers,” Canad. Jl. Math., 17, 449–467.Google Scholar
5. 
Edmonds, J. (1965b). “Maximum Matching and a Polyhedron with (0,1) Vertices,” Jl. Res. Nat. Bur. Standards Sect. B, 69B, 125–130.Google Scholar
6. 
Edmonds, J. and Johnson, E.L. (1973). “Matching, Euler Tours and the Chinese Postman,” Math. Programming, 5, 88–124.Google Scholar
7. 
Even, S. and Kariv, O. (1975). “An O(n 5/2) Algorithm for Maximum Matching in General Graphs,” 16th Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, New York, 100–112.Google Scholar
8. 
Galil, Z., Micali, S., and Gabow, H. (1982). “Priority Queues with Variable Priority and an O (EV log V) Algorithm for finding a Maximal Weighted Matching in General Graphs,” 23rd Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, New York, 255–261.Google Scholar
9. 
Gabow, H.N. (1976). “An Efficient Implementation of Edmond's Algorithm for Maximum Matching on Graphs,” Jl. Assoc. Comput. Mach., 23, 221–234.Google Scholar
10. 
Gerards, A.M.H. (1995). “Matching.” In M.O. Ball, T.L. Magnanti, C.L. Monma, and G.L. Nemhauser, eds. Network Models, Handbooks in Operations Research and Management Science, vol. 7, 135–224, Elsevier, Amsterdam.Google Scholar
11. 
Gondran, M. and Minoux, M. (1984). Graphs and Algorithms. John Wiley, Chichester.Google Scholar
12. 
Jonker, R. and Volgenant, A. (1986). “Improving the Hungarian Assignment Algorithm,” Opl Res. Lett., 5, 171–175.Google Scholar
13. 
Kuhn, H.W. (1955). “The Hungarian Method for the Assignment Problem,” Naval Res. Logist. Quart., 2, 83–97.Google Scholar
14. 
Kuhn, H.W. (1956). “Variants of the Hungarian Method for Assignment Problems,” Naval Res. Logist. Quart., 3, 253–258.Google Scholar
15. 
Kwan, Mei-Ko (1962). “Graphic Programming Using Odd and Even Points,” Chinese Math., 1, 273–277.Google Scholar
16. 
Lawler, E.L. (1976). Combinatorial Optimization, Networks and Matroids. Holt, Rinehart and Winston, New York.Google Scholar
17. 
Lovasz L. and Plummer, M.D. (1986). Matching Theory. Annals of Discrete Mathematics, vol. 29, North-Holland, Amsterdam.Google Scholar
18. 
McHugh, James A. (1990). Algorithmic Graph Theory. Prentice-Hall, London.Google Scholar
19. 
Micali, S. and Vazirani, V.V. (1980). “An O(V 1/2E) Algorithm for Finding Maximum Matching in General Graphs,” 21st Annual Symposium on Foundations of Computer Science, IEEE Computer Society Press, New York, 17–27.Google Scholar
20. 
Miller, D.L. (1995). “A Matching Based Exact Algorithm for Capacitated Vehicle Routing Problems,” ORSA Jl. Computing, 7, 1–9.Google Scholar
21. 
Wright, M.B. (1990). “Speeding Up the Hungarian Algorithm,” Computers Opns Res., 17, 95–96.Google Scholar