Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
From MaRDI portal
(Redirected from Publication:4764341)
Cited in
(58)- Discrete convex analysis
- A characterization of graphs having all (g,f)-factors
- The membership problem in jump systems
- The delta-sum of matching delta-matroids
- The linear delta-matroid parity problem
- Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability
- Homogeneous multivariate polynomials with the half-plane property
- Polynomials with the half-plane property and the support theorems
- Polynomial combinatorial algorithms for skew-bisubmodular function minimization
- On structures of bisubmodular polyhedra
- Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2
- Extension of M-convexity and L-convexity to polyhedral convex functions
- A characterization of bisubmodular functions
- Decomposition of a bidirected graph into strongly connected components and its signed poset structure
- A generalization of permanent inequalities and applications in counting and optimization
- Eulerian and bipartite binary delta-matroids
- A note on M-convex functions on jump systems
- The salesman's improved tours for fundamental classes
- Generalized matroid matching
- Matroids, delta-matroids and embedded graphs
- Generalized skew bisubmodularity: a characterization and a min-max theorem
- Bisubmodular polyhedra, simplicial divisions, and discrete convexity
- Parametric bisubmodular function minimization and its associated signed ring family
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- A weighted independent even factor algorithm
- Polynomials with the half-plane property and matroid theory
- Geometry of jump systems
- Even factors, jump systems, and discrete convexity
- A polyhedral approach to bisubmodular function minimization
- Algebraic algorithms for linear matroid parity problems
- Half-integrality, LP-branching, and FPT algorithms
- Decomposition theorems for square-free 2-matchings in bipartite graphs
- Recent developments in discrete convex analysis
- Matroids -- the engineers' revenge
- An extension of Lehman's theorem and ideal set functions
- Triangle-free 2-matchings and M-concave functions on jump systems
- Generalized roof duality and bisubmodular functions
- 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
- Signed ring families and signed posets
- A survey of fundamental operations on discrete convex functions of various kinds
- On basic operations related to network induction of discrete convex functions
- Coverings and delta-coverings
- Greedy systems of linear inequalities and lexicographically optimal solutions
- From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals
- Optimal general factor problem and jump system intersection
- Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids
- Characterizations of the set of integer points in an integral bisubmodular polyhedron
- Weakly greedy algorithm and pair-Delta-matroids
- Rank functions and invariants of delta-matroids
- Optimal general factor problem and jump system intersection
- Finding a maximum restricted t-matching via Boolean edge-CSP
- Finding a maximum restricted \(t\)-matching via Boolean edge-CSP
- Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization
- On \(0,\pm 1\) matrices, odd vectors, and bisubmodular polyhedra
- Submodular function minimization
- Induction of M-convex functions by linking systems
This page was built for publication: Delta-Matroids, Jump Systems, and Bisubmodular Polyhedra
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4764341)
