Structural properties and decomposition of linear balanced matrices
Mathematical Programming: Series A and B
Properties of balanced and perfect matrices
Mathematical Programming: Series A and B
Testing balancedness and perfection of linear matrices
Mathematical Programming: Series A and B
Balance 0, ±1-matrices, bicoloring and total dual integrality
Mathematical Programming: Series A and B
Decomposition of balanced matrices
Journal of Combinatorial Theory Series B
Balanced 0, ±1 matrices I. decomposition
Journal of Combinatorial Theory Series B
Balanced 0, ±1 matrices II. recognition algorithm
Journal of Combinatorial Theory Series B
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
Discrete Applied Mathematics - Brazilian symposium on graphs, algorithms and combinatorics
Combinatorica
Even-hole-free graphs part I: Decomposition theorem
Journal of Graph Theory
Even-hole-free graphs part II: Recognition algorithm
Journal of Graph Theory
Probe Matrix Problems: Totally Balanced Matrices
AAIM '07 Proceedings of the 3rd international conference on Algorithmic Aspects in Information and Management
Decomposition of even-hole-free graphs with star cutsets and 2-joins
Journal of Combinatorial Theory Series B
On minimal forbidden subgraph characterizations of balanced graphs
Discrete Applied Mathematics
| Hi-index | 0.00 |
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.