An O(n log n) algorithm for the convex bipartite matching problem

An efficient algorithm to solve the maximum cardinality matching problem in convex bipartite graphs is presented. In the algorithm use is made of a special data structure based on a binary heap.

[1]  Clifford S. Orloff,et al.  Route Constrained Fleet Scheduling , 1976 .

[2]  Robert E. Tarjan,et al.  Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[3]  F. Glover.  Maximum matching in a convex bipartite graph , 1967 .

[4]  Sartaj Sahni,et al.  A parallel matching algorithm for convex bipartite graphs and applications to scheduling , 1984, J. Parallel Distributed Comput..