scientific article; zbMATH DE number 4045794
From MaRDI portal
Publication:3783328
[For the entire collection see Zbl 0638.00009.] We examine the minimum number of complete bipartite subdigraphs needed to cover and partition acyclic digraphs. The minimums have an exact value for unilaterally connected digraphs, and bounds are obtained for weakly connected digraphs. We also solve the interpolation problem with these bounds. The results are extended to examine the binary and nonnegative integer ranks of a related class of (0-1)-matrices. In addition, we study the biclique cover and partition numbers of weakly, unilaterally, and strongly connected digraphs with cycles.
Recommendations
- Publication:3478420
- scientific article; zbMATH DE number 426165
- Biclique covers and partitions
- Bipartite graphs and digraphs with equal biclique cover and partition numbers
- scientific article; zbMATH DE number 4031723
- Fractional biclique covers and partitions of graphs
- scientific article; zbMATH DE number 1439493
- scientific article; zbMATH DE number 4031722
- On biclique partitions of the complete graph
- Bipartite Coverings of Graphs
Cited in
(16)- Acyclic digraphs with Gallai-Milgram-Linial property for clique-covers
- Acyclic graphoidal covers and path partitions in a graph
- Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices
- Bipartite graphs and digraphs with equal biclique cover and partition numbers
- scientific article; zbMATH DE number 426165 (Why is no real title available?)
- scientific article; zbMATH DE number 4148115 (Why is no real title available?)
- scientific article; zbMATH DE number 4031722 (Why is no real title available?)
- scientific article; zbMATH DE number 4031723 (Why is no real title available?)
- scientific article; zbMATH DE number 146669 (Why is no real title available?)
- scientific article; zbMATH DE number 4128849 (Why is no real title available?)
- scientific article; zbMATH DE number 3995714 (Why is no real title available?)
- scientific article; zbMATH DE number 1439493 (Why is no real title available?)
- Optimal algorithm for converting an acyclic digraph to a cluster
- Biclique Coverings, Rectifier Networks and the Cost of ε-Removal
- Biclique coverings of regular bigraphs and minimum semiring ranks of regular matrices
- Minimum matrix rank of k-regular (0,1) matrices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783328)