A matching algorithm for regular bipartite graphs

A timetabling algorithm of Csima is extended to a class of algorithms. It is shown that a new algorithm of this class produces a perfect matching in an r-regular bipartite graph of 2n nodes in O(n²rlogr) time. The space requirement is NIL (apart from the space required for the input, assuming we do not have to save it). A match-making application is discussed and it is explained how marriages result between dating couples under certain dating customs.