A parallel algorithm for the maximal path problem (Q1100916)
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: A parallel algorithm for the maximal path problem |
scientific article; zbMATH DE number 4045189
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A parallel algorithm for the maximal path problem |
scientific article; zbMATH DE number 4045189 |
Statements
A parallel algorithm for the maximal path problem (English)
0 references
1987
0 references
In this paper we present an \(O(\log^ 5 n)\) time parallel algorithm for constructing a maximal path in an undirected graph. We also give an \(O(n^{1/2+\epsilon})\) time parallel algorithm for constructing a depth first search tree in an undirected graph.
0 references
parallel algorithm
0 references
maximal path
0 references
undirected graph
0 references
depth first search tree
0 references
