AbstractAs a variant of “valuated matroid” of Dress and Wenzel, we define the concept of a “valuated bimatroid” to investigate the combinatorial properties of 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
AbstractM. Iri has proved that the maximum rank for a pivotal system of matrices (i.e., combivalence...
AbstractA 0–1 matrix A is said to avoid a forbidden 0–1 matrix (or pattern) P if no submatrix of A m...
If G is a looped graph, then its adjacency matrix represents a binary matroid MA(G) on V (G). MA(G) ...
As a variant of 'valuated matroid' of Dress and Wenzel we define the notion of 'valuated bimatroid' ...
AbstractAs a variant of “valuated matroid” of Dress and Wenzel, we define the concept of a “valuated...
AbstractTwo algorithms are proposed for computing the maximum degree of a principal minor of specifi...
Two algorithms are proposed for computing the maximum degree of a principal minor of specified order...
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...
Abstract. The Theta rank of a finite point configuration V is the maximal degree necessary for a sum...
International audienceIn this note, we present the main results of a series of forthcoming papers, d...
AbstractLet P be a matrix property that is defined for the matrices over GF(2) or GF(3), and that is...
In this note, we present the main results of a series of forthcoming papers, dealing with bi-jective...
AbstractKönig's theorem asserts that the minimal number of lines (i.e., rows or columns) which conta...
AbstractM. Iri has proved that the maximum rank for a pivotal system of matrices (i.e., combivalence...
AbstractA 0–1 matrix A is said to avoid a forbidden 0–1 matrix (or pattern) P if no submatrix of A m...
If G is a looped graph, then its adjacency matrix represents a binary matroid MA(G) on V (G). MA(G) ...
As a variant of 'valuated matroid' of Dress and Wenzel we define the notion of 'valuated bimatroid' ...
AbstractAs a variant of “valuated matroid” of Dress and Wenzel, we define the concept of a “valuated...
AbstractTwo algorithms are proposed for computing the maximum degree of a principal minor of specifi...
Two algorithms are proposed for computing the maximum degree of a principal minor of specified order...
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...
Abstract. The Theta rank of a finite point configuration V is the maximal degree necessary for a sum...
International audienceIn this note, we present the main results of a series of forthcoming papers, d...
AbstractLet P be a matrix property that is defined for the matrices over GF(2) or GF(3), and that is...
In this note, we present the main results of a series of forthcoming papers, dealing with bi-jective...
AbstractKönig's theorem asserts that the minimal number of lines (i.e., rows or columns) which conta...
AbstractM. Iri has proved that the maximum rank for a pivotal system of matrices (i.e., combivalence...
AbstractA 0–1 matrix A is said to avoid a forbidden 0–1 matrix (or pattern) P if no submatrix of A m...
If G is a looped graph, then its adjacency matrix represents a binary matroid MA(G) on V (G). MA(G) ...
DOI
Add to ORKG