Maximum weighted edge biclique problem on bipartite graphs (Q779184)
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: Maximum weighted edge biclique problem on bipartite graphs |
scientific article; zbMATH DE number 7223690
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum weighted edge biclique problem on bipartite graphs |
scientific article; zbMATH DE number 7223690 |
Statements
Maximum weighted edge biclique problem on bipartite graphs (English)
0 references
21 July 2020
0 references
maximum weighted edge biclique
0 references
bipartite permutation graphs
0 references
chain graphs
0 references
NP-completeness
0 references
graph algorithms
0 references
0.9315536
0 references
0.9254583
0 references
0.9254583
0 references
0.9230922
0 references
0.91597044
0 references
0.91418236
0 references
0.90948564
0 references
0.9066217
0 references
0.9009871
0 references
