| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9516048 | Journal of Combinatorial Theory, Series B | 2005 | 19 Pages |
Abstract
A 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.
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Giacomo Zambelli,