Balanced 0, + or - Matrices. Part 1. Decomposition,

Abstract

A 0, + or - matrix is balanced if, in every square submatrix with two nonzero entries per row and column, the sum of the entries is a multiple of four. This paper extends the decomposition of balanced 0,1 matrices obtained by Conforti, Cornuejols and Rao to the class of balanced 0, + or - matrices. As a consequence, we obtain a polynomial time algorithm for recognizing balanced 0,+ or - matrices.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 22, 1994
Accession Number
ADA278170

Entities

People

  • Ajai Kapuur
  • Gérard Cornuéjols
  • Kristina Vušković
  • Michele Conforti

Organizations

  • Carnegie Mellon University

Tags

Communities of Interest

  • C4I

DTIC Thesaurus Topics

  • Algorithms
  • Attachment
  • Computer Programming
  • Construction
  • Coverings
  • Decomposition
  • Integer Programming
  • Integrals
  • Iterations
  • Linear Programming
  • Military Research
  • Notation
  • Polynomials
  • Recognition

Fields of Study

  • Mathematics

Readers

  • Linear Algebra