scientific article
From MaRDI portal
Publication:3934404
zbMath0478.05027MaRDI QIDQ3934404
No author found.
Publication date: 1981
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial aspects of matroids and geometric lattices (05B35) Mathematical programming (90C99)
Related Items (37)
Packing non-zero \(A\)-paths via matroid matching ⋮ New algorithms for linear \(k\)-matroid intersection and matroid \(k\)-parity problems ⋮ The membership problem in jump systems ⋮ An application of submodular flows ⋮ Maximum genus and maximum nonseparating independent set of a 3-regular graph ⋮ On the nonseparating independent set problem and feedback set problem for graphs with no vertex degree exceeding three ⋮ Optimal general factor problem and jump system intersection ⋮ FPT-Algorithms for the \(\ell\) -Matchoid Problem with a Coverage Objective ⋮ Matroid matching and some applications ⋮ The linear delta-matroid parity problem ⋮ On the complexity of packing rainbow spanning trees ⋮ Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three ⋮ Matroid Intersection under Restricted Oracles ⋮ Matchings and \(\Delta\)-matroids ⋮ The ellipsoid method and its consequences in combinatorial optimization ⋮ An algorithm for weighted fractional matroid matching ⋮ A simple PTAS for weighted matroid matching on strongly base orderable matroids ⋮ An appraisal of computational complexity for operations researchers ⋮ A constrained independent set problem for matroids ⋮ On feedback vertex set: new measure and new structures ⋮ A Weighted Linear Matroid Parity Algorithm ⋮ Structural properties of matroid matchings ⋮ Matroid matching with Dilworth truncation ⋮ Spanning trees of 3-uniform hypergraphs ⋮ Packing $A$-Paths in Group-Labelled Graphs via Linear Matroid Parity ⋮ Complexity of packing common bases in matroids ⋮ Algebraic algorithms for fractional linear matroid parity via noncommutative rank ⋮ Fractional matroid matchings ⋮ Bidirectional retracting-free double tracings and upper embeddability of graphs ⋮ Generalized matroid matching ⋮ Unnamed Item ⋮ A simple PTAS for Weighted Matroid Matching on Strongly Base Orderable Matroids ⋮ On matroid parity and matching polytopes ⋮ Applications of matroids in electric network theory ⋮ Approximating minimum feedback vertex sets in hypergraphs ⋮ A linear programming formulation of Mader's edge-disjoint paths problem ⋮ Locally defined independence systems on graphs
This page was built for publication:
