Combinatorial algorithms for matchings, even factors and square-free 2-factors
type: Item
instance of: scholarly article
title: Combinatorial algorithms for matchings, even factors and square-free 2-factors
zbMATH Open document ID: 1192.05122
author: Gyula Pap
published in: Mathematical Programming. Series A. Series B
publication date: 2007-04-19T00:00:00Z
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5145049
zbMATH Keywords: modification of Edmonds' algorithm
zbMATH Keywords: restricted matching problems
MaRDI profile type: Publication
full work available at URL: s10107-006-0053-9
OpenAlex ID: W2019720686
cites work: Primal-dual approach for directed vertex connectivity augmentation and generalizations
cites work: The optimal path-matching problem
cites work: Paths, Trees, and Flowers
cites work: Restricted \(t\)-matchings in bipartite graphs
cites work: Minimal edge-coverings of pairs of sets
cites work: Note on the path‐matching formula
cites work: An algebraic matching algorithm
cites work: Q4263715
cites work: Finding maximum square-free 2-matchings in bipartite graphs
cites work: On the maximum even factor in weakly symmetric graphs
cites work: Q4737513
DOI: 10.1007/S10107-006-0053-9
description: scientific article; zbMATH DE number 5145049