Title of article
Balanced 0, ±1 Matrices I. Decomposition
Author/Authors
Conforti، نويسنده , , Michele and Cornuéjols، نويسنده , , Gérard and Kapoor، نويسنده , , Ajai and Vu?kovi?، نويسنده , , Kristina، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2001
Pages
32
From page
243
To page
274
Abstract
A 0, ±1 matrix is balanced if, in every square submatrix with two nonzero entries per row and column, the sum of the entries is a multiple of four. This paper extends the decomposition of balanced 0, 1 matrices obtained by Conforti, Cornuéjols, and Rao (1999, J. Combin. Theory Ser. B77, 292–406) to the class of balanced 0, ±1 matrices. As a consequence, we obtain a polynomial time algorithm for recognizing balanced 0, ±1 matrices.
Keywords
2-join , Recognition algorithm , extended star cutset , 6-join , Balanced matrix , decomposition
Journal title
Journal of Combinatorial Theory Series B
Serial Year
2001
Journal title
Journal of Combinatorial Theory Series B
Record number
1526786
Link To Document