Highly parallelizable problems on sorted intervals (Q673932)
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: Highly parallelizable problems on sorted intervals |
scientific article; zbMATH DE number 985840
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Highly parallelizable problems on sorted intervals |
scientific article; zbMATH DE number 985840 |
Statements
Highly parallelizable problems on sorted intervals (English)
0 references
28 February 1997
0 references
Combinatorial optimization problem
0 references
Interval graph
0 references
CRCW PRAM model
0 references
Highly parallelizable
0 references
Minimum total dominating set
0 references
Minimum connected dominating set
0 references
Depth first search tree
0 references
0.860053539276123
0 references
0.8569188117980957
0 references
0.8563229441642761
0 references
