TR-2004-18

Alternating paths revisited I: even factors

Gyula Pap



Abstract

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:

@techreport{egres-04-18,
AUTHOR = {Pap, Gyula},
TITLE = {Alternating paths revisited {I}: even factors},
NOTE= {{\tt www.cs.elte.hu/egres}},
INSTITUTION = {Egerv{\'a}ry Research Group, Budapest},
YEAR = {2004},
NUMBER = {TR-2004-18}
}


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