An efficient parallel algorithm for planarity (Q1114415)
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 efficient parallel algorithm for planarity |
scientific article; zbMATH DE number 4083004
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An efficient parallel algorithm for planarity |
scientific article; zbMATH DE number 4083004 |
Statements
An efficient parallel algorithm for planarity (English)
0 references
1988
0 references
The authors give a parallel algorithm for testing graph planarity, and for finding an embedding of a planar graph. Their algorithm runs in \(O(\log^ 2 n)\) steps on n processors of a CREW PRAM. This is an improvement to a previous best parallel algorithm due to Ja'Ja' and Simon. The new algorithm uses efficient parallel algorithms for manipulating a sophisticated data structure for representing sets of embeddings - the PQ-tree originally invented by Booth and Lueker.
0 references
parallel algorithm
0 references
planarity
0 references
embedding
0 references
PQ-tree
0 references
0 references
