AbstractA 0,±1 matrix is balanced if it does not contain a square submatrix with two nonzero elements per row and column in which the sum of all entries is 2 modulo 4. Conforti et al. (J. Combin. Theory B 77 (1999) 292; B 81 (2001) 275), provided a polynomial algorithm to test balancedness of a matrix. In this paper we present a simpler polynomial algorithm, based on techniques introduced by Chudnovsky and Seymour (Combinatorica, to appear) for Berge graphs
A 0, 1 matrix is balanced if it does not contain a square submatrix of odd order with two ones per r...
A unified approach is pursued for designing efficient and numerically reliable algorithms for polyno...
International audienceCoppersmith has introduced a block version of Wiedemann's algorithm. The metho...
A 0,±1 matrix is balanced if it does not contain a square submatrix with two nonzero elements per ro...
AbstractIn this paper we give a polynomial time recognition algorithm for balanced 0, ±1 matrices. T...
In this paper we give a polynomial time recognition algorithm for balanced 0, ±1 matrices. This algo...
£94 o 0-114 In this paper we give a polynomial time regocnition algorithm for balanced 0, ± matrice...
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 it does not contain a square submatrix with exactly two nonzero entri...
AbstractA 0, ±1 matrix is balanced if, in every square submatrix with two nonzero entries per row an...
Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this conc...
An n n matrix with nonnegative entries is said to be balanced if for each i = 1,...., n, the sum of ...
A graph is balanced if its clique-matrix contains no edge–vertex incidence matrix of an odd chordles...
AbstractIn this paper we present several characterizations of the class of strongly chordal graphs. ...
A 0, 1 matrix is balanced if it does not contain a square submatrix of odd order with two ones per r...
A unified approach is pursued for designing efficient and numerically reliable algorithms for polyno...
International audienceCoppersmith has introduced a block version of Wiedemann's algorithm. The metho...
A 0,±1 matrix is balanced if it does not contain a square submatrix with two nonzero elements per ro...
AbstractIn this paper we give a polynomial time recognition algorithm for balanced 0, ±1 matrices. T...
In this paper we give a polynomial time recognition algorithm for balanced 0, ±1 matrices. This algo...
£94 o 0-114 In this paper we give a polynomial time regocnition algorithm for balanced 0, ± matrice...
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 it does not contain a square submatrix with exactly two nonzero entri...
AbstractA 0, ±1 matrix is balanced if, in every square submatrix with two nonzero entries per row an...
Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this conc...
An n n matrix with nonnegative entries is said to be balanced if for each i = 1,...., n, the sum of ...
A graph is balanced if its clique-matrix contains no edge–vertex incidence matrix of an odd chordles...
AbstractIn this paper we present several characterizations of the class of strongly chordal graphs. ...
A 0, 1 matrix is balanced if it does not contain a square submatrix of odd order with two ones per r...
A unified approach is pursued for designing efficient and numerically reliable algorithms for polyno...
International audienceCoppersmith has introduced a block version of Wiedemann's algorithm. The metho...
DOI
Add to ORKG