01/09/1985
This paper discusses minimum matching in a trinomial doubly convex bipartite graph. The graph consists of three categories of arcs forming a doubly convex structure. The matching involves lexicographical minimization in required order of categories. Due to the special structure of the problem, certain 'greedy' procedures are found to be optimal.