A weighted even factor algorithm

DOI10.1007/s10107-007-0154-0zbMath1390.90484OpenAlexW1976127440MaRDI QIDQ948958

Kenjiro Takazawa

Publication date: 16 October 2008

Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10107-007-0154-0

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids ⋮ Improved algorithms for even factors and square-free simple \(b\)-matchings ⋮ A weighted independent even factor algorithm ⋮ Even factors, jump systems, and discrete convexity

Cites Work

• On the maximum even factor in weakly symmetric graphs
• Combinatorial algorithms for matchings, even factors and square-free 2-factors
• Short proofs on the matching polyhedron
• The optimal path-matching problem
• Matching, matroids, and extensions
• A Combinatorial Algorithm to Find a Maximum Even Factor
• A Gallai–Edmonds‐type structure theorem for path‐matchings
• Note on the path‐matching formula
• Paths, Trees, and Flowers
• Maximum matching and a polyhedron with 0,1-vertices
• Integer Programming and Combinatorial Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A weighted even factor algorithm