Abstract
An algorithm for assigning the members of two disjoint equal sets to each other under the criterion of Stable Marriage is analysed and the results compared to the experimental results obtained on a computer. The number of comparisons is shown to be of ordern logn (wheren is the size of the sets) which is better than that achieved by algorithms for solving the Classical Assignment Problem.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
