A convexity upper bound for the number of maximal bicliques of a bipartite graph (Q2448895)
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: A convexity upper bound for the number of maximal bicliques of a bipartite graph |
scientific article; zbMATH DE number 6292067
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A convexity upper bound for the number of maximal bicliques of a bipartite graph |
scientific article; zbMATH DE number 6292067 |
Statements
A convexity upper bound for the number of maximal bicliques of a bipartite graph (English)
0 references
5 May 2014
0 references
maximal bicliques
0 references
convex bipartite graph
0 references
consecutive ones property
0 references
0.8306390047073364
0 references
0.8256686329841614
0 references
0.8222681283950806
0 references
0.8218860030174255
0 references
0.8138453364372253
0 references
