Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs (Q2928591)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs |
scientific article; zbMATH DE number 6367139
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs |
scientific article; zbMATH DE number 6367139 |
Statements
10 November 2014
0 references
bicliques
0 references
bipartite graph
0 references
computational complexity
0 references
partitioning problem
0 references
0.9376676
0 references
0.93538857
0 references
0.9330734
0 references
0.92797947
0 references
0.92797947
0 references
0.9190058
0 references
0 references
0.91872925
0 references
Partitioning the vertex set of a bipartite graph into complete bipartite subgraphs (English)
0 references
