Maximum edge bicliques in tree convex bipartite graphs (Q4632202)
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 7048099
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Maximum edge bicliques in tree convex bipartite graphs |
scientific article; zbMATH DE number 7048099 |
Statements
Maximum Edge Bicliques in Tree Convex Bipartite Graphs (English)
0 references
26 April 2019
0 references
maximum edge biclique
0 references
tree-convex bipartite graphs
0 references
star-convex bipartite graphs
0 references
triad-convex bipartite graphs
0 references
NP-completeness
0 references
polynomial time
0 references
0 references
0 references
0 references
0.8579639792442322
0 references
0.8554755449295044
0 references
0.8468112349510193
0 references
0.8125129342079163
0 references
0.8083949685096741
0 references
