Efficiently parallelizable problems on a class of decomposable graphs (Q1765226)
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: Efficiently parallelizable problems on a class of decomposable graphs |
scientific article; zbMATH DE number 2137265
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Efficiently parallelizable problems on a class of decomposable graphs |
scientific article; zbMATH DE number 2137265 |
Statements
Efficiently parallelizable problems on a class of decomposable graphs (English)
0 references
23 February 2005
0 references
Decomposable graphs
0 references
Parallel algorithms
0 references
PRAM
0 references
Subgraph optimization problems
0 references
Rooted trees
0 references
Series-parallel graphs
0 references
0 references
0.9362195134162904
0 references
0.8234076499938965
0 references
0.822029173374176
0 references
0.8118764758110046
0 references
