Planarity testing in parallel

Authors:
Vijaya Ramachandran;John Reif
Affiliations:
-;-
Venue:
Proceedings of the 30th IEEE symposium on Foundations of computer science
Year:
1994

Citing 14
Cited 11

Towards optimal parallel bucket sorting

Information and Computation
Parallel ear decomposition search (EDS) and st-numbering in graphs

Theoretical Computer Science
On finding lowest common ancestors: simplification and parallelization

SIAM Journal on Computing
Approximate parallel scheduling. II.: applications to logarithmic-time optimal parallel graph algorithms

Information and Computation
Improved algorithms for graph four-connectivity

Journal of Computer and System Sciences
Parallel algorithms for shared-memory machines

Handbook of theoretical computer science (vol. A)
An optimal randomized parallel algorithm for finding connected components in a graph

SIAM Journal on Computing
Parallel tree contraction part 2: further applications

SIAM Journal on Computing
Finding triconnected components by local replacement

SIAM Journal on Computing
Efficient Planarity Testing

Journal of the ACM (JACM)
Symmetric Complementation

Journal of the ACM (JACM)
Computing ears and branchings in parallel

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
An optimal parallel algorithm for graph planarity

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

Journal of Computer and System Sciences

Optimal randomized EREW PRAM algorithms for finding spanning forests and for other basic graph connectivity problems

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
An efficient parallel algorithm for the general planar monotone circuit value problem4

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
A new NC-algorithm for finding a perfect matching in bipartite planar and small genus graphs (extended abstract)

STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The Complexity of Planarity Testing

STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
The complexity of planarity testing

Information and Computation
The combinatorial approach yields an NC algorithm for computing Pfaffians

Discrete Applied Mathematics
A linear work, O(n1/6) time, parallel algorithm for solving planar Laplacians

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Planar graphs: logical complexity and parallel isomorphism tests

STACS'07 Proceedings of the 24th annual conference on Theoretical aspects of computer science
Planarity testing revisited

TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Evaluating monotone circuits on cylinders, planes and tori

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Testing graph isomorphism in parallel by playing a game

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a parallel algorithm based on open ear decomposition to construct an embedding of a graph onto the plane or report that the graph is nonplanar. Our parallel algorithm runs on a CRCW PRAM in logarithmic time with a number of processors bounded by that needed for finding connected components in a graph and for performing bucket sort.