Preserving the Basic Property of Stable Matching by Deleting a pair
Data Structures and Algorithms
2014-01-20 v1
Abstract
This paper describes the transition of a male-pessimal matching set to optimal when it is a man-oriented approach by deleting a pair from matching set considering the score based approach. A descriptive explanation of the proposed algorithm both in a sequential and parallel manner is given. The comparison based theoretical analysis shows that the best case of the algorithm is lower bound of n3.
Cite
@article{arxiv.1401.4245,
title = {Preserving the Basic Property of Stable Matching by Deleting a pair},
author = {Ekta Gupta and Kalyani and Nitin},
journal= {arXiv preprint arXiv:1401.4245},
year = {2014}
}
Comments
5 pages, 6 tables, 2 figures, International Conference in Distributed Computing & Internet Technology (ICDCIT-2014) http://www.ijcaonline.org/proceedings/icdcit2014/number1/14379-1303