A weighted even factor algorithm
type: Item
instance of: scholarly article
title: A weighted even factor algorithm
zbMATH Open document ID: 1390.90484
author: Kenjiro Takazawa
published in: Mathematical Programming. Series A. Series B
publication date: 2008-10-16T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5351839
MaRDI profile type: Publication
full work available at URL: s10107-007-0154-0
OpenAlex ID: W1976127440
cites work: Matching, matroids, and extensions
cites work: The optimal path-matching problem
cites work: Q4197644
cites work: Maximum matching and a polyhedron with 0,1-vertices
cites work: Paths, Trees, and Flowers
cites work: Note on the path‐matching formula
cites work: Integer Programming and Combinatorial Optimization
cites work: Q4040221
cites work: A Combinatorial Algorithm to Find a Maximum Even Factor
cites work: Combinatorial algorithms for matchings, even factors and square-free 2-factors
cites work: On the maximum even factor in weakly symmetric graphs
cites work: Short proofs on the matching polyhedron
cites work: A Gallai–Edmonds‐type structure theorem for path‐matchings
cites work: Q4737513
DOI: 10.1007/S10107-007-0154-0
description: scientific article; zbMATH DE number 5351839