pith. sign in

arxiv: 1401.4245 · v1 · pith:S3RW2AI5new · submitted 2014-01-17 · 💻 cs.DS

Preserving the Basic Property of Stable Matching by Deleting a pair

classification 💻 cs.DS
keywords matchingalgorithmapproachdeletingpairanalysisbasicbest
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.