Efficiently parallelizable problems on a class of decomposable graphs (Q1765226): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Normalize DOI. |
||
| Property / DOI | |||
| Property / DOI: 10.1016/j.jcss.2004.08.003 / rank | |||
| Property / DOI | |||
| Property / DOI: 10.1016/J.JCSS.2004.08.003 / rank | |||
Normal rank | |||
Latest revision as of 09:41, 11 December 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
0 references
