Title: Maximum Cardinality Popular MatchingsSpeaker: Ishan Bansal Affiliation: University of Waterloo Room: MC 5479
We have seen the algorithm by Abraham, Irving, Kavitha, and Mehlhorn which deals with finding popular matchings (can be easily modified to give maximum cardinality popular matchings) in bipartite graphs with one-sided preference lists.
Title: Finding perfect matchings in random regular graphs in linear expected timeSpeaker: Michael Anastos Affiliation: Carnegie Mellon University Room: MC 5501
In a seminal paper on finding large matchings in sparse random graphs, Karp and Sipser proposed two algorithms for this task. The second algorithm has been intensely studied, but due to technical difficulties, the first algorithm has received less attention. Empirical results suggest that the first algorithm is superior.