Talk:Finding the largest popular matching in a bipartite graph
From Egres Open
NP-complete if ties are allowed -- Tamás Király 15:16, 28 December 2009 (UTC)
A new paper by Biró, Irving and Manlove shows that the problem is NP-complete if ties are allowed in the preference lists. I revised the problem statement accordingly.
