AbstractA 0,±1 matrix is balanced if, in every submatrix with two nonzero entries per row and column, the sum of the entries is a multiple of 4. This definition was introduced by Truemper and generalizes the notion of balanced 0,1 matrix introduced by Berge. In this tutorial, we survey what is currently known about these matrices: polyhedral results, combinatorial and structural theorems, and recognition algorithms
AbstractIt is shown that a balanced matrix whose row sums are ⩽3 is totally unimodular. The proof is...
In this paper we give a polynomial time recognition algorithm for balanced 0, ±1 matrices. This algo...
In this paper, we show that a matrix that maps ℓ′′ into ℓ′′ can be obtained from any RH-regular mat...
AbstractA 0, ±1 matrix is balanced if, in every square submatrix with two nonzero entries per row an...
AbstractA 0,±1 matrix is balanced if, in every submatrix with two nonzero entries per row and column...
A 0, ±1 matrix is balanced if, in every square submatrix with two nonzero entries per row and column...
A 0,±1 matrix is balanced if, in every submatrix with two nonzero entries per row and column, the su...
A 0/ ± 1 matrix is balanced if it does not contain a square submatrix with exactly two nonzero entri...
A 0, 1 matrix is balanced if it does not contain a square submatrix of odd order with two ones per r...
A 0,±1 matrix is balanced if it does not contain a square submatrix with two nonzero elements per ro...
AbstractA 0,±1 matrix is balanced if it does not contain a square submatrix with two nonzero element...
An n n matrix with nonnegative entries is said to be balanced if for each i = 1,...., n, the sum of ...
AbstractIn this paper we give a polynomial time recognition algorithm for balanced 0, ±1 matrices. T...
A Hadamard matrix is balanced splittable if some subset of its rows has the property that the dot pr...
Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this conc...
AbstractIt is shown that a balanced matrix whose row sums are ⩽3 is totally unimodular. The proof is...
In this paper we give a polynomial time recognition algorithm for balanced 0, ±1 matrices. This algo...
In this paper, we show that a matrix that maps ℓ′′ into ℓ′′ can be obtained from any RH-regular mat...
AbstractA 0, ±1 matrix is balanced if, in every square submatrix with two nonzero entries per row an...
AbstractA 0,±1 matrix is balanced if, in every submatrix with two nonzero entries per row and column...
A 0, ±1 matrix is balanced if, in every square submatrix with two nonzero entries per row and column...
A 0,±1 matrix is balanced if, in every submatrix with two nonzero entries per row and column, the su...
A 0/ ± 1 matrix is balanced if it does not contain a square submatrix with exactly two nonzero entri...
A 0, 1 matrix is balanced if it does not contain a square submatrix of odd order with two ones per r...
A 0,±1 matrix is balanced if it does not contain a square submatrix with two nonzero elements per ro...
AbstractA 0,±1 matrix is balanced if it does not contain a square submatrix with two nonzero element...
An n n matrix with nonnegative entries is said to be balanced if for each i = 1,...., n, the sum of ...
AbstractIn this paper we give a polynomial time recognition algorithm for balanced 0, ±1 matrices. T...
A Hadamard matrix is balanced splittable if some subset of its rows has the property that the dot pr...
Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this conc...
AbstractIt is shown that a balanced matrix whose row sums are ⩽3 is totally unimodular. The proof is...
In this paper we give a polynomial time recognition algorithm for balanced 0, ±1 matrices. This algo...
In this paper, we show that a matrix that maps ℓ′′ into ℓ′′ can be obtained from any RH-regular mat...
DOI
Add to ORKG