Abstract
Claude Berge defines a (0, 1) matrix A to be linear ifA does not contain a 2 × 2 submatrix of all ones.A(0, 1) matrixA is balanced ifA does not contain a square submatrix of odd order with two ones per row and column.
The contraction of a rowi of a matrix consists of the removal of rowi and all the columns that have a 1 in the entry corresponding to rowi.
In this paper we show that if a linear balanced matrixA does not belong to a subclass of totally unimodular matrices, thenA orA T contains a rowi such that the submatrix obtained by contracting rowi has a block-diagonal structure.
Article PDF
Avoid common mistakes on your manuscript.
References
R.F. Anstee and M. Farber, “Characterizations of totally balanced matrices,”Journal of Algorithms 5 (1984) 215–230.
C. Berge, “Balanced matrices,”Mathematical Programming 2 (1972) 19–31.
C. Berge, “Balanced matrices and the property G,”Mathematical Programming Study 12 (1980) 163–175.
C. Berge, “Minimax theorems for normal and balanced hypergraphs: A survey,”Annals of Discrete Mathematics 21 (1984) 3–21.
C. Berge and M. Las Vergnas, “Sur un theoreme du type Konig pour les hypergraphes,”Annals of New York Academy of Sciences 175 (1970) 32–40.
M. Conforti and M.R. Rao, “Structural properties and decomposition of restricted and strongly unimodular matrices,”Mathematical Programming 38 (1987a) 17–27.
M. Conforti and M.R. Rao, “Odd cycles and 0, 1 matrices,” to appear in:Mathematical Programming (series B) (1987b).
M. Conforti and M.R. Rao, “Testing balancedness and perfection of linear graphs,” preprint, New York University (New York, 1988).
J. Fonlupt and A. Zemirline, “A polynomial recognition algorithm for perfect (K 4—e)-free perfect graphs,” Research Report, University of Grenoble (Grenoble, 1987).
A. Frank, “On a class of balanced hypergraphs,” mimeo, Research Institute for Telecommunications (Budapest, 1979).
D.R. Fulkerson, A.J. Hoffman and R. Oppenheim, “On balanced matrices,”Mathematical Programming Study 1 (1974), 120–132.
A. Hoffman, A. Kolen and M. Sakarovitch, “Totally balanced and greedy matrices,”SIAM Journal of Algebraic and Discrete Methods 6 (1985) 721–730.
M. Padberg, “Characterizations of totally unimodular, balanced and perfect matrices,”Combinatorial Programming, Methods and Applications (1975) 279–289.
P.D. Seymour, “Decomposition of regular matroids,”Journal of Combinatorial Theory B-28 (1980) 305–359.
M. Yannakakis, “On a class of totally unimodular matrices,”Mathematics of Operations Research 10 (2) (1985) 280–304.
Author information
Authors and Affiliations
Additional information
Partial support from NSF grant DMS 8606188, ECS 8800281 and DDM 8800281.
Rights and permissions
About this article
Cite this article
Conforti, M., Rao, M.R. Structural properties and decomposition of linear balanced matrices. Mathematical Programming 55, 129–168 (1992). https://doi.org/10.1007/BF01581196
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01581196