Linear time algorithm for computing a small biclique in graphs without long induced paths (Q2904550)
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: Linear time algorithm for computing a small biclique in graphs without long induced paths |
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Linear time algorithm for computing a small biclique in graphs without long induced paths |
scientific article |
Statements
Linear Time Algorithm for Computing a Small Biclique in Graphs without Long Induced Paths (English)
0 references
14 August 2012
0 references
0.7915276288986206
0 references
0.7889382839202881
0 references
0.7788163423538208
0 references
0.7765772342681885
0 references
0.771625280380249
0 references
