On covering graphs by complete bipartite subgraphs (Q1025967)
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 5569087
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On covering graphs by complete bipartite subgraphs |
scientific article; zbMATH DE number 5569087 |
Statements
On covering graphs by complete bipartite subgraphs (English)
0 references
23 June 2009
0 references
edge clique covering number
0 references
biclique
0 references
fractional covers
0 references
Boolean functions
0 references
communication complexity
0 references
0 references
0.8597362041473389
0 references
0.8499910235404968
0 references
0.829382598400116
0 references
0.8089263439178467
0 references
