Efficiently parallelizable problems on a class of decomposable graphs (Q1765226): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.jcss.2004.08.003 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2061700222 / rank | |||
Normal rank | |||
Revision as of 19:43, 19 March 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
