On perfect 0, +/- 1 matrices,


Perfect 0,±1 matrices were introduced recently in [5] as a generalization of the well-studied class of perfect 0, 1 matrices. In this paper we provide a characterization of perfect 0,±1 matrices in terms of an associated perfect graph which one can build in O(nm) time, where m × n is the size of the matrix. We also obtain an algorithm of the same time… (More)
DOI: 10.1016/S0012-365X(96)00163-X


1 Figure or Table