Stable Marriages by Coroutines

LA home

Information Processing Letters, 16(2), 26 February 1983, pp.61-65

Lloyd Allison, Department of Computer Science, University of Western Australia, Nedlands 6009, Western Australia Received 9 August 1982; revised 12 November 1982

Abstract. The stable marriage problem is an appealing version of many pairing problems. A solution by coroutines is given, based on the recursive algorithm of McVitie and Wilson (1971). There are few published algorithms where coroutines are really useful but they solve this problem very naturally.

© L. Allison   (or as otherwise indicated),
Created with "vi (Linux or Solaris)",  charset=iso-8859-1,  fetched Wednesday, 20-Sep-2017 10:43:58 EDT.

free: Linux, Ubuntu operating-sys, OpenOffice office-suite, The GIMP ~photoshop,
Firefox web-browser, FlashBlock flash on/off.