Matroid matching and some applications
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3141016 (Why is no real title available?)
- scientific article; zbMATH DE number 3654136 (Why is no real title available?)
- scientific article; zbMATH DE number 3750968 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3635849 (Why is no real title available?)
- scientific article; zbMATH DE number 3334016 (Why is no real title available?)
- scientific article; zbMATH DE number 3422402 (Why is no real title available?)
- Matroid Intersection
- Maximum-Minimum Sätze und verallgemeinerte Faktoren von Graphen
- Paths, Trees, and Flowers
- Rado's theorem for polymatroids
- The Factorization of Linear Graphs
- Über die Maximalzahl kantendisjunkter A-Wege
- Über die Maximalzahl kreuzungsfreier H-Wege
Cited in
(76)- Tree metrics and edge-disjoint \(S\)-paths
- Recent developments in discrete convex analysis
- A polynomial kernel for distance-hereditary vertex deletion
- Singular spaces of matrices and their application in combinatorics
- Structural properties of matroid matchings
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
- A linear programming formulation of Mader's edge-disjoint paths problem
- On Finding Hamiltonian Cycles in Barnette Graphs
- Packing \(A\)-paths in group-labelled graphs via linear matroid parity
- A short proof of Mader's \(\mathcal S\)-paths theorem
- Matroid matching with Dilworth truncation
- Combinatorial auctions with decreasing marginal utilities
- Approximating bounded degree deletion via matroid matching
- Pseudomatroids
- On some combinatorial properties of algebraic matroids
- The delta-sum of matching delta-matroids
- A unifying approach to descriptive geometry and mechanisms
- Free multiflows in bidirected and skew-symmetric graphs
- The Complexity of Acyclic Subhypergraph Problems
- On matroid parity and matching polytopes
- Feedback vertex set reconfiguration in planar graphs
- On cycles through prescribed vertices in weakly separable graphs
- An algorithm for packing non-zero \(A\)-paths in group-labelled graphs
- The parity problem of polymatroids without double circuits
- Optimization problems with color-induced budget constraints
- An augmenting path algorithm for linear matroid parity
- Subspace arrangements, graph rigidity and derandomization through submodular optimization
- A Scaling Algorithm for the Maximum Node-Capacitated Multiflow Problem
- On the graphic matroid parity problem
- Packing non-returning \(A\)-paths algorithmically
- Optimal matroid partitioning problems
- Source location with rigidity and tree packing requirements
- scientific article; zbMATH DE number 7238987 (Why is no real title available?)
- Algebraic algorithms for linear matroid parity problems
- Boundary classes for graph problems involving non-local properties
- Optimal matroid partitioning problems
- A network theory approach to the rigidity of skeletal structures. I: Modelling and interconnection
- Finite prime-field characteristic sets for planar configurations
- Degree conditions for the existence of vertex-disjoint cycles and paths: a survey
- A fast algorithm for the path 2-packing problem
- Weighted linear matroid parity
- Slider-pinning rigidity: a Maxwell-Laman-type theorem
- On enumerating monomials and other combinatorial structures by polynomial interpolation
- An appraisal of computational complexity for operations researchers
- Coverings and delta-coverings
- An algorithm for weighted fractional matroid matching
- On Some Problems in the Design of Plane Skeletal Structures
- A weighted linear matroid parity algorithm
- Spanning trees of 3-uniform hypergraphs
- Optimal matching forests and valuated delta-matroids
- Packing non-zero \(A\)-paths via matroid matching
- Packings and 2-packings of A-paths
- The \(d\)-dimensional rigidity matroid of sparse graphs
- Solving the linear matroid parity problem as a sequence of matroid intersection problems
- Multiflows and disjoint paths of minimum total cost
- A parameterized view on matroid optimization problems
- Fanout limitations on constraint systems
- Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three
- Randomized algorithms in combinatorial optimization: A survey
- A randomized polynomial kernel for subset feedback vertex set
- The membership problem in jump systems
- The linear delta-matroid parity problem
- Minimally connected \(r\)-uniform hypergraphs
- Generating functions and counting formulas for spanning trees and forests in hypergraphs
- Optimal general factor problem and jump system intersection
- Simultaneous feedback edge set: a parameterized perspective
- Representing matroids over the reals is \(\exists \mathbb{R}\)-complete
- The Bhargava greedoid as a Gaussian elimination greedoid
- scientific article; zbMATH DE number 7559128 (Why is no real title available?)
- Finding Maximum Edge-Disjoint Paths Between Multiple Terminals
- Pfaffian pairs and parities: counting on linear matroid intersection and parity problems
- Iterated parallel union of matroids
- Matroid Intersection under Restricted Oracles
- The work of June Huh
- Edge deletion to tree-like graph classes
- Algebraic algorithms for fractional linear matroid parity via noncommutative rank
This page was built for publication: Matroid matching and some applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1144584)
