AbstractIn this paper we give a polynomial time recognition algorithm for balanced 0, ±1 matrices. This algorithm is based on a decomposition theorem proved in a companion paper
AbstractA balanced graph is a bipartite graph with no induced circuit of length 2(mod4). These graph...
AbstractA balanced vertex-coloring of a graph G is a function c from V(G) to {−1,0,1} such that ∑{c(...
Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this conc...
AbstractA 0, ±1 matrix is balanced if, in every square submatrix with two nonzero entries per row an...
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...
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 two nonzero elements per ro...
£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 it does not contain a square submatrix with two nonzero element...
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 it does not contain a square submatrix of odd order with two ones per r...
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 graph is balanced if its clique-matrix contains no edge–vertex incidence matrix of an odd chordles...
AbstractA balanced graph is a bipartite graph with no induced circuit of length 2(mod4). These graph...
AbstractA balanced vertex-coloring of a graph G is a function c from V(G) to {−1,0,1} such that ∑{c(...
Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this conc...
AbstractA 0, ±1 matrix is balanced if, in every square submatrix with two nonzero entries per row an...
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...
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 two nonzero elements per ro...
£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 it does not contain a square submatrix with two nonzero element...
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 it does not contain a square submatrix of odd order with two ones per r...
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 graph is balanced if its clique-matrix contains no edge–vertex incidence matrix of an odd chordles...
AbstractA balanced graph is a bipartite graph with no induced circuit of length 2(mod4). These graph...
AbstractA balanced vertex-coloring of a graph G is a function c from V(G) to {−1,0,1} such that ∑{c(...
Berge defined a hypergraph to be balanced if its incidence matrix is balanced. We consider this conc...
DOI
Add to ORKG