Complete Matching in a Trinomial Doubly-Convex Complete Bipartite Graph

Ankolekar Suresh and Patel Nitin R

IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department

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.

Date: 1985-09-01
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:iim:iimawp:wp00658

Access Statistics for this paper

More papers in IIMA Working Papers from Indian Institute of Management Ahmedabad, Research and Publication Department Contact information at EDIRC.
Bibliographic data for series maintained by ().