In this paper we give a polynomial time recognition algorithm for balanced 0, \1 matrices. This algorithm is based on a decomposition theorem proved in a companion paper.
Balanced 0, ±1 Matrices I. Decomposition
✍ Scribed by Michele Conforti; Gérard Cornuéjols; Ajai Kapoor; Kristina Vušković
- Publisher
- Elsevier Science
- Year
- 2001
- Tongue
- English
- Weight
- 287 KB
- Volume
- 81
- Category
- Article
- ISSN
- 0095-8956
No coin nor oath required. For personal study only.
✦ Synopsis
A 0, \1 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, Cornue jols, and Rao (1999, J. Combin. Theory Ser. B 77, 292 406) to the class of balanced 0, \1 matrices. As a consequence, we obtain a polynomial time algorithm for recognizing balanced 0, \1 matrices.
📜 SIMILAR VOLUMES
We define a 0,1 matrix \(M\) to be ideal if all vertices of the polyhedron \(\{x: M x \geqslant 1\), \(x \geqslant 0\}\) have only 0,1 components. We expand the list of known minor minimal nonideal matrices by several thousand. Many of these examples are obtained polyhedrally, by constructing new mi
This paper is a survey of the main propertics of special O-1 matrices. All thcsc prcrpertles are presented in a unified bmework (in terms of matrices and not in terms of hypergraphs). The paper contains no original result and no proof. NuI doute que I'une des idles de Bcrge quand il a introduit le c