Abstract Two characterizations are given for a valuated delta-matroid. Let ( V, 3) be an even delta-matroid on a finite set V with the family 3 of feasible sets. I t is shown that a function S: T-+ R is a valuation of (V, 3) if and only if, for each linear weighting p: V Ã ‘ R, the maximizers of S + p form the family of feasible sets of a delta-matroid. It is also shown that S is a valuation if and only if its conjugate function is "locally bisubmodular " a t each point. 1
Two algorithms are proposed for computing the maximum degree of a principal minor of specified order...
\u3cp\u3eWe show that each algebraic representation of a matroid M in positive characteristic determ...
Many important invariants for matroids and polymatroids are valuations (or are valuative), which is ...
Two characterizations are given for a valuated delta-matroid. Let (V,F) be an even delta-matroid on ...
Two further equivalent axioms are given for valuations of a matroid. Let M = (V,B) be a matroid on a...
We investigate delta-matroids which are formed by families of subsets of a finite ground set such th...
Dress A, WENZEL W. A greedy-algorithm characterization of valuated Δ-matroids. Applied Mathematics L...
AbstractThis paper addresses a generalization of the matroid parity problem to delta-matroids. We gi...
AbstractWe consider a generalization of finite matroids called delta matroids. This structure has be...
In this paper we address two of the major foundational questions in the theory of matroids over ring...
AbstractWe study a variant of the greedy algorithm for weight functions defined on the system of sub...
AbstractRecently Dress and Wenzel introduced the concept of a valuated matroid in terms of a quantit...
Recently Dress and Wenzel introduced the concept of valuated matroid in terms of a quantitative exte...
AbstractThe concept of valuated matroids was introduced by Dress and Wenzel as a quantitative extens...
The weighted matroid intersection problem has recently been extended to the valuated matroid interse...
Two algorithms are proposed for computing the maximum degree of a principal minor of specified order...
\u3cp\u3eWe show that each algebraic representation of a matroid M in positive characteristic determ...
Many important invariants for matroids and polymatroids are valuations (or are valuative), which is ...
Two characterizations are given for a valuated delta-matroid. Let (V,F) be an even delta-matroid on ...
Two further equivalent axioms are given for valuations of a matroid. Let M = (V,B) be a matroid on a...
We investigate delta-matroids which are formed by families of subsets of a finite ground set such th...
Dress A, WENZEL W. A greedy-algorithm characterization of valuated Δ-matroids. Applied Mathematics L...
AbstractThis paper addresses a generalization of the matroid parity problem to delta-matroids. We gi...
AbstractWe consider a generalization of finite matroids called delta matroids. This structure has be...
In this paper we address two of the major foundational questions in the theory of matroids over ring...
AbstractWe study a variant of the greedy algorithm for weight functions defined on the system of sub...
AbstractRecently Dress and Wenzel introduced the concept of a valuated matroid in terms of a quantit...
Recently Dress and Wenzel introduced the concept of valuated matroid in terms of a quantitative exte...
AbstractThe concept of valuated matroids was introduced by Dress and Wenzel as a quantitative extens...
The weighted matroid intersection problem has recently been extended to the valuated matroid interse...
Two algorithms are proposed for computing the maximum degree of a principal minor of specified order...
\u3cp\u3eWe show that each algebraic representation of a matroid M in positive characteristic determ...
Many important invariants for matroids and polymatroids are valuations (or are valuative), which is ...