The biclique k-clustering problem in bipartite graphs and its application in bioinformatics (Q2883562): Difference between revisions
From MaRDI portal
Created claim: Wikidata QID (P12): Q57707483, #quickstatements; #temporary_batch_1711055989931 |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Inapproximability of Maximum Weighted Edge Biclique and Its Applications / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Branch-and-Price: Column Generation for Solving Huge Integer Programs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of approximating the independent set problem / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Biclique completion problems for multicast network design / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The maximum edge biclique problem is NP-complete / rank | |||
Normal rank | |||
Latest revision as of 04:24, 5 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The biclique k-clustering problem in bipartite graphs and its application in bioinformatics |
scientific article |
Statements
The biclique k-clustering problem in bipartite graphs and its application in bioinformatics (English)
0 references
13 May 2012
0 references
maximum edge biclique
0 references
biclique clustering
0 references
biclustering
0 references
