A combinatorial algorithm to find a maximum even factor

Authors:
Gyula Pap
Affiliations:
Department of Operations Research, Eötvös University, Budapest, Hungary
Venue:
IPCO'05 Proceedings of the 11th international conference on Integer Programming and Combinatorial Optimization
Year:
2005

Citing 4
Cited 2

A Generalization of Edmonds' Matching and Matroid Intersection Algorithms

Proceedings of the 9th International IPCO Conference on Integer Programming and Combinatorial Optimization
On the maximum even factor in weakly symmetric graphs

Journal of Combinatorial Theory Series B
Note on the path-matching formula

Journal of Graph Theory
A Gallai–Edmonds-type structure theorem for path-matchings

Journal of Graph Theory

The independent even factor problem

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Even factors, jump systems, and discrete convexity

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

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.