A note on two parallel algorithms to solve the stable marriage problem

Authors:
Michael J. Quinn
Affiliations:
Univ. of New Hampshire, Durham
Venue:
BIT
Year:
1985

Citing 0
Cited 1

On finding a stable roommate, job, or spouse: a case study crossing the boundaries of computer science courses

SIGCSE '92 Proceedings of the twenty-third SIGCSE technical symposium on Computer science education

Quantified Score

Hi-index	0.00

Visualization

Abstract