Library Header Image
LSE Research Online LSE Library Services

A polynomial recognition algorithm for balanced matrices

Zambelli, Giacomo (2005) A polynomial recognition algorithm for balanced matrices. Journal of Combinatorial Theory, Series B, 95 (1). pp. 49-67. ISSN 0095-8956

Full text not available from this repository.
Identification Number: 10.1016/j.jctb.2005.02.006


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.

Item Type: Article
Official URL:
Additional Information: © 2005 Elsevier
Divisions: Management
Subjects: Q Science > QA Mathematics
Date Deposited: 26 Jan 2011 14:17
Last Modified: 20 Apr 2021 00:45

Actions (login required)

View Item View Item