On Gazit and Miller's Parallel Algorithm for Planar Separators: Achieving Greater Efficiency Through Random Sampling

We show how to obtain a work-efficient parallel algorithm for finding a planar separator. The algorithm requires O(rz’ ) time for any given positive constant e.

• Type: Conference
• Year: 1993
• Where: SPAA
• Authors: Philip N. Klein
• Keywords: Distributed And Parallel Computing, Positive Constant E, SPAA 1993, Work-efficient Parallel Algorithm