Optimal General Matchings

Szymon Dudycz, Katarzyna Paluch

Given a graph $G=(V,E)$ and for each vertex $v\in V$ a subset $B(v)$ of the set $\{0,1,\dots ,d_G(v)\}$ a $B$-matching of $G$ is any set $F\subseteq E$ such that $d_F(v) \in B(v…