Combinatorial algorithms for matchings, even factors and square-free 2-factors

Authors:
Gyula Pap
Affiliations:
Eötvös University, Department of Operations Research, Pázmány P. s. 1/C, 1117, Budapest, Hungary
Venue:
Mathematical Programming: Series A and B
Year:
2007

Citing 0
Cited 6

Even factors, jump systems, and discrete convexity

Journal of Combinatorial Theory Series B
A Weighted kt, t-Free t-Factor Algorithm for Bipartite Graphs

Mathematics of Operations Research
A weighted Kt, t-free t-factor algorithm for bipartite graphs

IPCO'08 Proceedings of the 13th international conference on Integer programming and combinatorial optimization
An algorithm for (n-3)-connectivity augmentation problem: Jump system approach

Journal of Combinatorial Theory Series B
A proof of Cunningham's conjecture on restricted subgraphs and jump systems

Journal of Combinatorial Theory Series B
A simple algorithm for finding a maximum triangle-free 2-matching in subcubic graphs

Discrete Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.