A linear-processor algorithm for depth-first search in planar graphs (Q1110342): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 02:12, 31 January 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A linear-processor algorithm for depth-first search in planar graphs |
scientific article |
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
