Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
From MaRDI portal
Publication:2118149
DOI10.1007/s10107-021-01661-yzbMath1489.90158OpenAlexW2988186967MaRDI QIDQ2118149
Publication date: 22 March 2022
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/2433/252767
Related Items
Cites Work
- Unnamed Item
- Triangle-free 2-matchings and M-concave functions on jump systems
- 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
- Combinatorial algorithms for matchings, even factors and square-free 2-factors
- A matching problem with side conditions
- Geometric algorithms and combinatorial optimization
- Restricted \(t\)-matchings in bipartite graphs
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
- Matching, matroids, and extensions
- Improved algorithms for even factors and square-free simple \(b\)-matchings
- Polyhedron of triangle-free simple 2-matchings in subcubic graphs
- Excluded \(t\)-factors in bipartite graphs: a unified framework for nonbipartite matchings and restricted 2-matchings
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- Finding maximum square-free 2-matchings in bipartite graphs
- A Weighted kt, t-Free t-Factor Algorithm for Bipartite Graphs
- On Maximum Cost $K_{t,t}$‐Free t‐Matchings of Bipartite Graphs
- Restricted b-Matchings in Degree-Bounded Graphs
- Odd Minimum Cut Sets and b-Matchings Revisited
- Perfect triangle-free 2-matchings
- Odd Minimum Cut-Sets and b-Matchings
- A weighted linear matroid parity algorithm
- Weighted Triangle-Free 2-Matching Problem with Edge-Disjoint Forbidden Triangles
- Maximum matching and a polyhedron with 0,1-vertices
- Extended formulations in combinatorial optimization
