Pseudomatroids
From MaRDI portal
Publication:1109779
DOI10.1016/0012-365X(88)90101-XzbMath0656.05023MaRDI QIDQ1109779
R. Chandrasekaran, Santosh N. Kabadi
Publication date: 1988
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
Strongly polynomial and fully combinatorial algorithms for bisubmodular function minimization, Circuit separation for symmetric matroids, A characterization of bisubmodular functions, Basis graphs of even delta-matroids, On \(0,\pm 1\) matrices, odd vectors, and bisubmodular polyhedra, Note on exchange axioms for valuated matroids and valuated delta-matroids, A polyhedral approach to bisubmodular function minimization, Two algorithms for valuated \(\Delta\)-matroids, The delta-sum of matching delta-matroids, Decomposition of a bidirected graph into strongly connected components and its signed poset structure, Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs, Coverings and delta-coverings, From matrix pivots to graphs in surfaces: exploring combinatorics through partial duals, Interlacement and activities in delta-matroids, Generalized roof duality and bisubmodular functions, The linear delta-matroid parity problem, Geodesic property of greedy algorithms for optimization problems on jump systems and delta-matroids, First-order logic axiomatization of metric graph theory, Characterizations of the set of integer points in an integral bisubmodular polyhedron, Polyhedra with submodular support functions and their unbalanced simultaneous exchangeability, A proof of Cunningham's conjecture on restricted subgraphs and jump systems, A note on M-convex functions on jump systems, Bipolarization of posets and natural interpolation, The Orthant Non-Interaction Theorem for Certain Combinatorial Polyhedra and its Implications in the Intersection and the Dilworth Truncation of Bisubmodular Functions, Representability of \(\bigtriangleup\)-matroids over \(GF(2)\), On pseudomatroid property of matrices, \(b\)-matching degree-sequence polyhedra, Delta matroids whose fundamental graphs are bipartite, Optimal Matching Forests and Valuated Delta-Matroids, On set functions that can be extended to convex functionals, A 2-isomorphism theorem for delta-matroids, Polynomial combinatorial algorithms for skew-bisubmodular function minimization, Submodular function minimization, Discrete convexity and polynomial solvability in minimum 0-extension problems, Even factors, jump systems, and discrete convexity, Greedy systems of linear inequalities and lexicographically optimal solutions, On structures of bisubmodular polyhedra, An exact cutting plane method for \(k\)-submodular function maximization, On totally dual integral systems, Polybasic polyhedra: Structure of polyhedra with edge vectors of support size at most 2, Base polytopes of series-parallel posets: Linear description and optimization, Signed ring families and signed posets, Generalized skew bisubmodularity: a characterization and a min-max theorem, Bisubmodular polyhedra, simplicial divisions, and discrete convexity, Multimatroids. IV: Chain-group representations, Irreducibility of the Tutte polynomial of an embedded graph, Parametric bisubmodular function minimization and its associated signed ring family
Cites Work
