MATCHING.

Authors :: Eglese, Richard W.
Source :: Encyclopedia of Operations Research & Management Science; 2001, p490-492, 3p
Publication Year :: 2001
Abstract: The article provides information on matching problems. It form an important branch of graph theory. It also form a class of integer linear programming problems which can be solved in polynomial time. It discusses matching on bipartite graphs. It explains job scheduling. It examines the close connection between arc routing problems and matching.