Covering graphs with few complete bipartite subgraphs (Q1019181)
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 5558987
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Covering graphs with few complete bipartite subgraphs |
scientific article; zbMATH DE number 5558987 |
Statements
Covering graphs with few complete bipartite subgraphs (English)
0 references
28 May 2009
0 references
bicliques
0 references
parameterized complexity
0 references
covering and partitioning problems
0 references
0 references
0.980088233947754
0 references
0.8777286410331726
0 references
0.846368134021759
0 references
0.8386369943618774
0 references
0.8355696797370911
0 references
