Balanced 0, ± 1 Matrices II. Recognition Algorithm

Journal of Combinatorial Theory. Series B

Volumn 81, Issue 2, 2001, Pages 275-306

  Conforti, Michele ^a   Cornuéjols, Gérard ^b   Kapoor, Ajai ^a   Vušković, Kristina ^c  

^a UNIVERSITY OF PADOVA   (Italy)

^b CARNEGIE MELLON UNIVERSITY   (United States)

^c UNIVERSITY OF LEEDS   (United Kingdom)

Author keywords

2 join; 6 join; Balanced matrix; Decomposition; Extended star cutset; Recognition algorithm

Indexed keywords

EID: 0345702579     PISSN: 00958956     EISSN: None     Source Type: Journal    
DOI: 10.1006/jctb.2000.2011     Document Type: Article

References (6)

1. M. Conforti, G. Cornuéjols, A. Kapoor, and K. Vušković, Balanced 0, ± 1 matrices. I. Decomposition, J. Combin. Theory Ser. B, in press; doi: 10.1006/jctb.2000.2011.
2. M. Conforti, G. Cornuéjols, A. Kapoor, and K. Vušković, Balanced matrices, in "Mathematical Programming: State of the Art 1994" (J. R. Birge and K. R. Murty, Eds.), pp. 1-33, The University of Michigan Press, Ann Arbor, MI, 1994.
3. M. Conforti, G. Cornuéjols, and M. R. Rao, Decomposition of balanced matrices, J. Combin. Theory Ser. B 77 (1999), 292-406.
4. M. Conforti and M. R. Rao, Properties of balanced and perfect matrices, Math. Programming 55 (1992), 35-47.
5. M. Conforti and M. R. Rao, Structural properties and recognition of restricted and strongly unimodular matrices, Math. Programming 38 (1987), 17-27.
6. G. Cornuéjols and W. H. Cunningham, Compositions for perfect graphs, Discrete Math. 55 (1985), 245-254.