A Strongly Polynomial-Time Algorithm for Weighted General Factors with Three Feasible Degrees

Shuai Shao, Stanislav Živný

General factors are a generalization of matchings. Given a graph $G$ with a set $\pi (v)$ of feasible degrees, called a degree constraint, for each vertex $v$ of $G$, the general fact…