论文信息 - Characterizations of Totally Balanced Matrices

Characterizations of Totally Balanced Matrices

Abstract A (0,1)-matrix is totally balanced if it does not contain as a submatrix the incidence matrix of any cycle of length at least 3. Several alternative characterizations of these matrices are presented. These characterizations follow from properties of strongly chordal graphs, studied by Farber, and maximal totally balanced matrices, studied by Anstee. Using these characterizations, efficient recognition algorithms for totally balanced matrices are presented. In addition, a new completion algorithm for building a maximal totally balanced matrix from an arbitrary totally balanced matrix follows from these results.

Richard P. Anstee | Martin Farber | M. Farber | R. Anstee

[1] Richard P. Anstee. Hypergraphs with no special cycles , 1983, Comb..

[2] Richard P. Anstee. Properties of (0, 1)-Matrices with No Triangles , 1980, J. Comb. Theory, Ser. A.

[3] Alan J. Hoffman,et al. A generalization of max flow—min cut , 1974, Math. Program..

[4] Richard P. Anstee,et al. Properties of (0, 1)-Matrices without Certain Configurations , 1981, J. Comb. Theory, Ser. A.

[5] J. Edmonds,et al. A Min-Max Relation for Submodular Functions on Graphs , 1977 .

[6] L. Lovász. Combinatorial problems and exercises , 1979 .

[7] H. J. Ryser,et al. A fundamental matrix equation for finite sets , 1972 .

[8] Martin Farber,et al. Domination, independent domination, and duality in strongly chordal graphs , 1984, Discret. Appl. Math..

[9] Richard P. Anstee,et al. Properties of (0,1)-Matrices With Forbidden Configurations , 1980 .

[10] Martin Farber,et al. Characterizations of strongly chordal graphs , 1983, Discret. Math..

[11] Andries E. Brouwer,et al. A super-balanced hypergraph has a nest point , 1980 .

[12] D. R. Fulkerson,et al. On balanced matrices , 1974 .

[13] Claude Berge,et al. Graphs and Hypergraphs , 2021, Clustering.