View of An efficient depth-first search algorithm for solving the maxi-mum stable marriage problem with ties and incomplete lists.

Return to Article Details An efficient depth-first search algorithm for solving the maxi-mum stable marriage problem with ties and incomplete lists. Download Download PDF