论文信息 - Balanced 0 ; 1 Matrices Part II : Recognition Algorithm

Balanced 0 ; 1 Matrices Part II : Recognition Algorithm

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.

M. Conforti | G. Cornu | A. Kapoor

[1] Gérard Cornuéjols,et al. Compositions for perfect graphs , 1985, Discret. Math..

[2] Michele Conforti,et al. Structural properties and recognition of restricted and strongly unimodular matrices , 1987, Math. Program..

[3] Michele Conforti,et al. Properties of balanced and perfect matrices , 1992, Math. Program..

[4] Gérard Cornuéjols,et al. Decomposition of Balanced Matrices , 1999, J. Comb. Theory, Ser. B.

[5] M. Conforti. Balanced 0 ; 1 Matrices Part I : Decomposition , 2000 .