No label defined (Q3783328)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4045794
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 4045794 |
Statements
1987
0 references
biclique cover number
0 references
complete bipartite subdigraphs
0 references
partition
0 references
acyclic digraphs
0 references
partition numbers
0 references
0 references
0.93248075
0 references
0.92476237
0 references
0.91931945
0 references
0 references
[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.
0 references