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
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An optimal EREW parallel algorithm for computing breadth-first search trees on permutation graphs |
scientific article |
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
