On Finding $\ell$-th Smallest Perfect Matchings

Nicolas El Maalouly, Sebastian Haslebacher, Adrian Taubner +1

Given an undirected weighted graph $G$ and an integer $k$, Exact-Weight Perfect Matching (EWPM) is the problem of finding a perfect matching of weight exactly $k$ in $G$. In this p…