A weighted independent even factor algorithm

DOI10.1007/s10107-010-0397-zzbMath1257.90086OpenAlexW2040246297MaRDI QIDQ2429469

Kenjiro Takazawa

Publication date: 27 April 2012

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

Full work available at URL: http://hdl.handle.net/2433/154867

zbMATH Keywords

combinatorial algorithmmatroid intersectionnonbipartite matchingdual integralityindependent even factor

Mathematics Subject Classification ID

Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids

Cites Work

• On the maximum even factor in weakly symmetric graphs
• Combinatorial algorithms for matchings, even factors and square-free 2-factors
• A weighted even factor algorithm
• The optimal path-matching problem
• Matching, matroids, and extensions
• Even factors, jump systems, and discrete convexity
• Matroid Intersection
• The Independent Even Factor Problem
• Matroid intersection algorithms
• A Gallai–Edmonds‐type structure theorem for path‐matchings
• Valuated Matroid Intersection I: Optimality Criteria
• Valuated Matroid Intersection II: Algorithms
• Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
• Note on the path‐matching formula
• Paths, Trees, and Flowers
• M-Convex Functions on Jump Systems: A General Framework for Minsquare Graph Factor Problem
• Maximum matching and a polyhedron with 0,1-vertices
• Integer Programming and Combinatorial Optimization
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item