Algorithms for finding biclique covers of graphs with bounded pathwidth (Q2906901)
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: Algorithms for finding biclique covers of graphs with bounded pathwidth |
scientific article; zbMATH DE number 6077880
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Algorithms for finding biclique covers of graphs with bounded pathwidth |
scientific article; zbMATH DE number 6077880 |
Statements
5 September 2012
0 references
space-efficient algorithms
0 references
biclique cover problems on graphs with bounded pathwidth
0 references
Algorithms for finding biclique covers of graphs with bounded pathwidth (English)
0 references
0.8311200141906738
0 references
0.8064885139465332
0 references
0.7903309464454651
0 references
0.7738412022590637
0 references
