An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (Q290218)
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: An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs |
scientific article; zbMATH DE number 6588294
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs |
scientific article; zbMATH DE number 6588294 |
Statements
An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs (English)
0 references
1 June 2016
0 references
parallel algorithms
0 references
permutation graphs
0 references
breadth-first search trees
0 references
0 references
0.8850447535514832
0 references
0.8412451148033142
0 references
0.8329600691795349
0 references
0.8155196905136108
0 references
