A parallel algorithm for recognizing unordered depth-first search (Q1111396): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: A random NC algorithm for depth first search / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A parallel search algorithm for directed acyclic graphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Finding the maximum, merging, and sorting in a parallel computation model / rank | |||
Normal rank | |||
Revision as of 10:58, 19 June 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel algorithm for recognizing unordered depth-first search |
scientific article |
Statements
A parallel algorithm for recognizing unordered depth-first search (English)
0 references
1988
0 references
We present a parallel algorithm for the concurrent-read, exclusive-write PRAM model that determines in \(O(\log^ 2 V)\) time using M(V) processors whether a given directed spanning forest of a given graph corresponds to some unordered depth-first search, where \(M(V)=O(V^{2.376})\) is the number of processors needed to do transitive closure in \(O(\log^ 2 V)\) time. If the answer is ``yes'', the depth-first numbering of the vertices is also output. The algorithm can be modified to avoid concurrent reading at the expense of more processors.
0 references
parallel algorithm
0 references
concurrent-read, exclusive-write PRAM
0 references
depth-first search
0 references
