A linear-processor algorithm for depth-first search in planar graphs (Q1110342)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 4072402
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A linear-processor algorithm for depth-first search in planar graphs |
scientific article; zbMATH DE number 4072402 |
Statements
A linear-processor algorithm for depth-first search in planar graphs (English)
0 references
1988
0 references
We present an n-processor and \(O(\log^ 2 n)\) time parallel RAM algorithm for finding a depth-first-search tree in an n-vertex planar graph. The algorithm is based on a new n-processor algorithm for finding a cyclic separator in a planar graph and Smith's [\textit{J. R. Smith}, SIAM J. Comput. 15, 814-830 (1986; Zbl 0612.68059)] original parallel depth- first-search algorithm for planar graphs.
0 references
parallel algorithm
0 references
cyclic separator
0 references
depth-first-search
0 references
planar graphs
0 references
0.9145225882530212
0 references
0.9053702354431152
0 references
0.899543046951294
0 references
0.8912252187728882
0 references
