Matching, matroids, and extensions
From MaRDI portal
Publication:1849530
DOI10.1007/s101070100256zbMath1030.90106OpenAlexW2155466993MaRDI QIDQ1849530
Publication date: 1 December 2002
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s101070100256
Combinatorial optimization (90C27) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (19)
Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles ⋮ On the maximum even factor in weakly symmetric graphs ⋮ Decomposition theorems for square-free 2-matchings in bipartite graphs ⋮ Triangle-free 2-matchings and M-concave functions on jump systems ⋮ Improved algorithms for even factors and square-free simple \(b\)-matchings ⋮ A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs ⋮ An algorithm for \((n-3)\)-connectivity augmentation problem: jump system approach ⋮ Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids ⋮ A weighted independent even factor algorithm ⋮ 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 ⋮ Matchings of cycles and paths in directed graphs ⋮ A weighted even factor algorithm ⋮ Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs ⋮ Finding maximum square-free 2-matchings in bipartite graphs ⋮ Submodular function minimization ⋮ Even factors, jump systems, and discrete convexity ⋮ 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: Matching, matroids, and extensions
