Complete matching in a trinomial doubly-convex complete bipartite graph

dc.contributor.author	Ankolekar, Suresh
dc.contributor.author	Patel, Nitin R.
dc.date.accessioned	2010-03-14T10:12:36Z
dc.date.available	2010-03-14T10:12:36Z
dc.date.copyright	1985-09
dc.date.issued	2010-03-14T10:12:36Z
dc.identifier.uri	http://hdl.handle.net/11718/1193
dc.description.abstract	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.	en
dc.language.iso	en	en
dc.relation.ispartofseries	WP;1985/582
dc.subject	Trinomial lattice	en
dc.subject	Convex bodies	en
dc.title	Complete matching in a trinomial doubly-convex complete bipartite graph	en
dc.type	Working Paper	en