| Article ID: | iaor19891032 |
| Country: | Italy |
| Volume: | 18 |
| Issue: | 46 |
| Start Page Number: | 63 |
| End Page Number: | 77 |
| Publication Date: | Jun 1988 |
| Journal: | Ricerca Operativa |
| Authors: | Scutell Maria Grazia, Scevola Gianluca |
The fastest algorithms appeared in the literature to solve the maximum matching problem on bipartite convex graph have been proposed by Lipski-Preparata and Gallo. The paper presents a new efficient algorithm, MGG, obtained by modifying Lipski-Preparata algorithm. Its running time is equal to the minimal running time of the two above mentioned algorithms. This paper also shows by means of a series of tests that the efficiency of MGG is not only theoretical but practical as well.