On \textsf{NC} algorithms for problems on bounded rank-width graphs (Q1799577)
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: On \textsf{NC} algorithms for problems on bounded rank-width graphs |
scientific article; zbMATH DE number 6958547
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On \textsf{NC} algorithms for problems on bounded rank-width graphs |
scientific article; zbMATH DE number 6958547 |
Statements
On \textsf{NC} algorithms for problems on bounded rank-width graphs (English)
0 references
19 October 2018
0 references
rank-width
0 references
NP-completeness
0 references
parallel algorithms
0 references
clique-width
0 references
0.8923841
0 references
0.89023274
0 references
0.8859217
0 references
0.88340616
0 references
0.88340616
0 references
0.8782342
0 references
0.87570405
0 references
0.87532717
0 references
0.87204987
0 references
