Add to ORKGAs a variant of 'valuated matroid' of Dress and Wenzel we define the notion of 'valuated bimatroid' to investigate the combinatorial properties possessed by the degree of subdeterminants of a rational function matrix. Two algorithms are developed for computing the maximum degree of a minor of specified order; the algorithms are valid also for 'valuated bimatroids' in general. (orig.)Also published as: SFB-303--94834Available from TIB Hannover: RN 4052(94834) / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman
During the last few years submodularity has intensively been investigated in combinatorial optimizat...
We give formulas and effective sharp bounds for the degree of multi-graded rational maps and provide...
AbstractM. Iri has proved that the maximum rank for a pivotal system of matrices (i.e., combivalence...
AbstractAs a variant of “valuated matroid” of Dress and Wenzel, we define the concept of a “valuated...
Two algorithms are proposed for computing the maximum degree of a principal minor of specified order...
AbstractTwo algorithms are proposed for computing the maximum degree of a principal minor of specifi...
AbstractKishi and Kajitani introduced the concepts of the principal partition of a graph and maximal...
This paper presents the first combinatorial polynomial algorithm for minimizing bisubmodular functio...
AbstractA bimatroid B between the sets S and T incorporates the combinatorial exchange properties of...
International audienceIn this note, we present the main results of a series of forthcoming papers, d...
In this note, we present the main results of a series of forthcoming papers, dealing with bi-jective...
Abstract. The Theta rank of a finite point configuration V is the maximal degree necessary for a sum...
AbstractKönig's theorem asserts that the minimal number of lines (i.e., rows or columns) which conta...
AbstractLet P be a matrix property that is defined for the matrices over GF(2) or GF(3), and that is...
AbstractThis paper characterizes, for each i and j, the matroids that are minor-minimal among connec...
During the last few years submodularity has intensively been investigated in combinatorial optimizat...
We give formulas and effective sharp bounds for the degree of multi-graded rational maps and provide...
AbstractM. Iri has proved that the maximum rank for a pivotal system of matrices (i.e., combivalence...
AbstractAs a variant of “valuated matroid” of Dress and Wenzel, we define the concept of a “valuated...
Two algorithms are proposed for computing the maximum degree of a principal minor of specified order...
AbstractTwo algorithms are proposed for computing the maximum degree of a principal minor of specifi...
AbstractKishi and Kajitani introduced the concepts of the principal partition of a graph and maximal...
This paper presents the first combinatorial polynomial algorithm for minimizing bisubmodular functio...
AbstractA bimatroid B between the sets S and T incorporates the combinatorial exchange properties of...
International audienceIn this note, we present the main results of a series of forthcoming papers, d...
In this note, we present the main results of a series of forthcoming papers, dealing with bi-jective...
Abstract. The Theta rank of a finite point configuration V is the maximal degree necessary for a sum...
AbstractKönig's theorem asserts that the minimal number of lines (i.e., rows or columns) which conta...
AbstractLet P be a matrix property that is defined for the matrices over GF(2) or GF(3), and that is...
AbstractThis paper characterizes, for each i and j, the matroids that are minor-minimal among connec...
During the last few years submodularity has intensively been investigated in combinatorial optimizat...
We give formulas and effective sharp bounds for the degree of multi-graded rational maps and provide...
AbstractM. Iri has proved that the maximum rank for a pivotal system of matrices (i.e., combivalence...