Finding maximum edge bicliques in convex bipartite graphs (Q1759663)
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: Finding maximum edge bicliques in convex bipartite graphs |
scientific article; zbMATH DE number 6109324
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Finding maximum edge bicliques in convex bipartite graphs |
scientific article; zbMATH DE number 6109324 |
Statements
Finding maximum edge bicliques in convex bipartite graphs (English)
0 references
21 November 2012
0 references
biclique
0 references
convex bipartite graph
0 references
biconvex graph
0 references
bipartite permutation graph
0 references
0 references
0 references
0.9999999
0 references
0.95660365
0 references
0.9254583
0 references
0.91483927
0 references
0.91477096
0 references
0.91266763
0 references
0.9072081
0 references
0.8920904
0 references
0.8920904
0 references
