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
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.
| Item Type: | Article |
|---|---|
| Official URL: | http://www.elsevier.com/wps/find/journaldescriptio... |
| Additional Information: | © 2005 Elsevier |
| Divisions: | Management |
| Subjects: | Q Science > QA Mathematics |
| Date Deposited: | 26 Jan 2011 14:17 |
| Last Modified: | 11 Dec 2024 22:55 |
| URI: | http://eprints.lse.ac.uk/id/eprint/31726 |
Actions (login required)
 |
View Item |
