Finding maximum edge bicliques in convex bipartite graphs (Q1759663): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1007/s00453-010-9486-x / rank | |||
| Property / DBLP publication ID | |||
| Property / DBLP publication ID: journals/algorithmica/NussbaumPSUZ12 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1007/S00453-010-9486-X / rank | |||
Normal rank | |||
Latest revision as of 08:57, 11 December 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Finding maximum edge bicliques in convex bipartite graphs |
scientific article |
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
