DOIAbstract
AbstractLet A be an m × n(0, 1)-matrix having row sums ⩾ r and column sums ⩽ c. An upper bound for the 1-width of A is obtained in terms of m, n, r, c
AbstractLet A be an m × n(0, 1)-matrix having row sums ⩾ r and column sums ⩽ c. An upper bound for the 1-width of A is obtained in terms of m, n, r, c
AbstractIn this paper, we exhibit new and sharper upper bounds of the spread of a matrix
from the United States Naval Postgraduate School A branch and bound technique is used to derive an a...
This paper gives a reduced formula for the precise number of matrices in A(R,S), the class of matric...
AbstractIn this note we establish upper bounds for the 1-width of an m × n matrix of 0's and 1's hav...
AbstractLet A be an m × n(0, 1)-matrix having row sums ⩾ r and column sums ⩽ c. An upper bound for t...
AbstractLet A be a matrix of m rows and n columns whose entries are either zero or one with row i of...
The trace norm of a matrix is the sum of its singular values. This paper presents results on the min...
AbstractLet A be a real strictly diagonally dominant M-matrix. We give a sharp upper bound for ‖A-1‖...
Given positive integers m, n, s, t, let z (m, n, s, t) be the maximum number of ones in a (0, 1) mat...
AbstractGiven positive integers m,n,s,t, let z(m,n,s,t) be the maximum number of ones in a (0,1) mat...
For t a positive integer, the t-term rank of a (0,1)-matrix A is defined to be the largest number of...
Let A be a matrix of m rows and n columns whose entries are either zero or one with row i of sum ri ...
AbstractFor t a positive integer, the t-term rank of a (0,1)-matrix A is defined to be the largest n...
In this note we give upper bounds for the number of vertices of the polyhedron $P(A,b) = \{x \in Rd:...
AbstractWe consider a m × n (0, 1)-matrix A, no repeated columns, which has no k × l sumatrix F. We ...
AbstractIn this paper, we exhibit new and sharper upper bounds of the spread of a matrix
from the United States Naval Postgraduate School A branch and bound technique is used to derive an a...
This paper gives a reduced formula for the precise number of matrices in A(R,S), the class of matric...
AbstractIn this note we establish upper bounds for the 1-width of an m × n matrix of 0's and 1's hav...
AbstractLet A be an m × n(0, 1)-matrix having row sums ⩾ r and column sums ⩽ c. An upper bound for t...
AbstractLet A be a matrix of m rows and n columns whose entries are either zero or one with row i of...
The trace norm of a matrix is the sum of its singular values. This paper presents results on the min...
AbstractLet A be a real strictly diagonally dominant M-matrix. We give a sharp upper bound for ‖A-1‖...
Given positive integers m, n, s, t, let z (m, n, s, t) be the maximum number of ones in a (0, 1) mat...
AbstractGiven positive integers m,n,s,t, let z(m,n,s,t) be the maximum number of ones in a (0,1) mat...
For t a positive integer, the t-term rank of a (0,1)-matrix A is defined to be the largest number of...
Let A be a matrix of m rows and n columns whose entries are either zero or one with row i of sum ri ...
AbstractFor t a positive integer, the t-term rank of a (0,1)-matrix A is defined to be the largest n...
In this note we give upper bounds for the number of vertices of the polyhedron $P(A,b) = \{x \in Rd:...
AbstractWe consider a m × n (0, 1)-matrix A, no repeated columns, which has no k × l sumatrix F. We ...
AbstractIn this paper, we exhibit new and sharper upper bounds of the spread of a matrix
from the United States Naval Postgraduate School A branch and bound technique is used to derive an a...
This paper gives a reduced formula for the precise number of matrices in A(R,S), the class of matric...
Add to ORKG