Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs (Q4785697)
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: Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs |
scientific article; zbMATH DE number 1848512
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs |
scientific article; zbMATH DE number 1848512 |
Statements
Characterization of Efficiently Parallel Solvable Problems on Distance-Hereditary Graphs (English)
0 references
5 January 2003
0 references
algorithms
0 references
data structures
0 references
distance-hereditary graphs
0 references
parallel random access machine
0 references
subgraph optimization problems
0 references
0.8575819730758667
0 references
0.853845477104187
0 references
0.8377787470817566
0 references
