Even factors and square-free 2-factors are restricted matching problems for which it seems to be difficult to generalize Edmonds' matching algorithm directly. Here, we present a slight modification of Edmonds' algorithm, which adapts to these restricted matching problems. Thus, we construct algorithms for these problems which do not use alternating forests.
展开▼