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

DOI10.1287/moor.1080.0365zbMath1220.90112OpenAlexW2159431671MaRDI QIDQ3169039

Kenjiro Takazawa

Publication date: 27 April 2011

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/moor.1080.0365

zbMATH Keywords

square-free 2-factordual integrality\(K_{t,t}\)-free t-factorcombinatorial primal-dual algorithm

Mathematics Subject Classification ID

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

Related Items (11)

Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles ⋮ Excluded $t$-Factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-Matchings, and Matroids ⋮ Decomposition theorems for square-free 2-matchings in bipartite graphs ⋮ An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach ⋮ A simple algorithm for finding a maximum triangle-free \(2\)-matching in subcubic graphs ⋮ A proof of Cunningham's conjecture on restricted subgraphs and jump systems ⋮ An algorithm for finding a maximum \(t\)-matching excluding complete partite subgraphs ⋮ Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs ⋮ A simple combinatorial algorithm for restricted 2-matchings in subcubic graphs -- via half-edges ⋮ Decomposition Theorems for Square-free 2-matchings in Bipartite Graphs ⋮ Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles

This page was built for publication: A Weighted k_{t, t}-Free t-Factor Algorithm for Bipartite Graphs