Alternating paths revisited I: even factors ?
Gyula Pap · 2004
We give a new, algorithmic proof for the maximum even factor formula which can be converted into a polynomial time combinatorial algorithm to solve the maximum even factor problem. In several aspects, the approach is similar to Edmonds’ Matching Algorithm, but there is a significant dierence.