Skip to main content
Article thumbnail
Location of Repository

A polynomial recognition algorithm for balanced matrices

By Giacomo Zambelli

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

Topics: QA Mathematics
Publisher: Elsevier B.V.
Year: 2005
DOI identifier: 10.1016/j.jctb.2005.02.006
OAI identifier: oai:eprints.lse.ac.uk:31726
Provided by: LSE Research Online
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://www.elsevier.com/wps/fi... (external link)
  • http://eprints.lse.ac.uk/31726... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.