Clique-width: when hard does not mean impossible (Q3113705)
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: Clique-width: when hard does not mean impossible |
scientific article; zbMATH DE number 5999564
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Clique-width: when hard does not mean impossible |
scientific article; zbMATH DE number 5999564 |
Statements
23 January 2012
0 references
clique-width
0 references
bi-rank-width
0 references
minimum leaf out-branching
0 references
minimum leaf spanning tree
0 references
edge-disjoint paths
0 references
0.8230249285697937
0 references
0.8009588122367859
0 references
0.7848067283630371
0 references
0.7828095555305481
0 references
0.7816742062568665
0 references
