Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
From MaRDI portal
Publication:810058
DOI10.1016/0095-8956(91)90006-6zbMath0733.05064OpenAlexW2165980303MaRDI QIDQ810058
David A. Gregory, J. Richard Lundgren, Kathryn Fraughnaugh Jones, Norman J. Pullman
Publication date: 1991
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(91)90006-6
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Property testing of the Boolean and binary rank, Unnamed Item, Further results on the minimum rank of regular classes of \((0,1)\)-matrices, Singular (0,1) matrices with constant row and column sums, The augmentation property of binary matrices for the binary and Boolean rank, The Boolean rank of the uniform intersection matrix and a family of its submatrices, The Nonnegative Rank of a Matrix: Hard Problems, Easy Solutions, Boolean rank of upset tournament matrices, Isolation number versus Boolean rank, Oriented spanning trees and stationary distribution of digraphs, On the binary and Boolean rank of regular matrices, Factorizations of matrices over semirings., Minimum matrix rank of k-regular (0,1) matrices, The complexity of tropical matrix factorization, Parameterized low-rank binary matrix approximation, Parameterized Low-Rank Binary Matrix Approximation, On maximal isolation sets in the uniform intersection matrix
Cites Work
- Applications of edge coverings by cliques
- Covering of graphs by complete bipartite subgraphs; complexity of 0-1 matrices
- On the addressing problem for directed graphs
- On the minimum rank of regular classes of matrices of zeros and ones
- Applying a proof of tverberg to complete bipartite decompositions of digraphs and multigraphs
- On the Addressing Problem for Loop Switching
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
