Alternating paths revisited I: even factors

Gyula Pap


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 difference.

Bibtex entry:

AUTHOR = {Pap, Gyula},
TITLE = {Alternating paths revisited {I}: even factors},
NOTE= {{\tt}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2004},
NUMBER = {TR-2004-18}

Last modification: 13.3.2018. Please email your comments to Tamás Király!