Matching, matroids, and extensions
From MaRDI portal
Recommendations
Cited in
(39)- Structural properties of matroid matchings
- The optimal path-matching problem
- Characterizing matchings as the intersection of matroids
- Matchings and matching extensions in graphs
- First steps in combinatorial optimization on graphons: matchings
- Finding a maximum 2-matching excluding prescribed cycles in bipartite graphs
- Improved algorithms for even factors and square-free simple \(b\)-matchings
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
- Extendability and criticality in matching theory
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- A weighted independent even factor algorithm
- Matchings of cycles and paths in directed graphs
- Matroid matching with Dilworth truncation
- Finding maximum square-free 2-matchings in bipartite graphs
- Even factors, jump systems, and discrete convexity
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- Matroid matching: the power of local search
- Matching as the Intersection of Matroids
- A Weighted K t,t -Free t-Factor Algorithm for Bipartite Graphs
- Matching Extendability in Hypercubes
- 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
- scientific article; zbMATH DE number 1123785 (Why is no real title available?)
- scientific article; zbMATH DE number 1953191 (Why is no real title available?)
- A proof of Cunningham's conjecture on restricted subgraphs and jump systems
- scientific article; zbMATH DE number 2086910 (Why is no real title available?)
- scientific article; zbMATH DE number 1405497 (Why is no real title available?)
- Weighted triangle-free 2-matching problem with edge-disjoint forbidden triangles
- Filtered matchings and simplicial complexes
- On the maximum even factor in weakly symmetric graphs
- Optimal general factor problem and jump system intersection
- Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids
- Finding triangle-free 2-factors in general graphs
- Finding a maximum restricted \(t\)-matching via Boolean edge-CSP
- On matroid parity and matching polytopes
- Optimal matchings in posets
- A weighted even factor algorithm
- Submodular function minimization
This page was built for publication: Matching, matroids, and extensions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1849530)
