A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs

DOI10.1007/978-3-540-68891-4_5zbMath1143.05335OpenAlexW2145231552MaRDI QIDQ3503840

Kenjiro Takazawa

Publication date: 10 June 2008

Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-68891-4_5

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Uncrossing a family of set-pairs
• Combinatorial algorithms for matchings, even factors and square-free 2-factors
• An application of simultaneous diophantine approximation in combinatorial optimization
• A matching problem with side conditions
• Restricted \(t\)-matchings in bipartite graphs
• Matching, matroids, and extensions
• Minimal edge-coverings of pairs of sets
• Restricted 2-factor polytopes
• Finding maximum square-free 2-matchings in bipartite graphs
• On Maximum Cost $K_{t,t}$‐Free t‐Matchings of Bipartite Graphs
• On Restricted Two-Factors
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Fibonacci heaps and their uses in improved network optimization algorithms
• On some techniques useful for solution of transportation network problems