Efficiently parallelizable problems on a class of decomposable graphs (Q1765226): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 07:19, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Efficiently parallelizable problems on a class of decomposable graphs |
scientific article |
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
