Volume : IV, Issue : XII, December - 2014

POPULAR SATISFACTORY MATCHING PROBLEM

Dr. T. Ramachandran, Dr. D. Udayakumar, K. Velusamy

Abstract :

An instance of the satisfactory marriage problem with strict preferences is considered for computing a maximum cardinality popular satisfactory matching in a bipartite graph G = (A B, E) where each vertex u A B ranks its neighbors in a strict order of preference. A matching is satisfactory popular if for every matching M in G, the satisfactory level of vertices that prefer M to is at most the satisfactory level of vertices that prefer to M. In this paper, an algorithm is described to find a maximum cardinality popular satisfactory matching in G= (A B, E).

Keywords :

Article: Download PDF   DOI : 10.36106/ijar  

Cite This Article:

Dr.T.Ramachandran, Dr. D. Udayakumar, K.Velusamy Popular Satisfactory Matching Problem Indian Journal of Applied Research, Vol.4, Issue : 12 December 2014

Number of Downloads : 491

References :