Search
Now showing items 1-1 of 1
Complete matching in a trinomial doubly-convex complete bipartite graph
(2010-03-14)
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 ...