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.

[1]  D. Rose,et al.  Generalized nested dissection , 1977 .

[2]  Bonnie Berger,et al.  Efficient NC Algorithms for Set Cover with Applications to Learning and Geometry , 1994, J. Comput. Syst. Sci..

[3]  Gary L. Miller,et al.  A unified geometric approach to graph separators , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[4]  László Lovász,et al.  On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[5]  Richard M. Karp,et al.  Probabilistic recurrence relations , 1994, JACM.

[6]  Mihalis Yannakakis,et al.  High-probability parallel transitive closure algorithms , 1990, SPAA '90.

[7]  Victor Y. Pan,et al.  Extension of the Parallel Nested Dissection Algorithm to Path Algebra Problems , 1986, FSTTCS.

[8]  R. Tarjan,et al.  A Separator Theorem for Planar Graphs , 1977 .

[9]  Mark K. Goldberg,et al.  Constructing a Maximal Independent Set in Parallel , 1989, SIAM J. Discret. Math..

[10]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[11]  Charles E. Leiserson,et al.  Area-efficient graph layouts , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[12]  Gary L. Miller,et al.  Finding Small Simple Cycle Separators for 2-Connected Planar Graphs , 1986, J. Comput. Syst. Sci..

[13]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[14]  Greg N. Frederickson,et al.  Fast Algorithms for Shortest Paths in Planar Graphs, with Applications , 1987, SIAM J. Comput..

[15]  Gary L. Miller,et al.  Finding small simple cycle separators for 2-connected planar graphs. , 1984, STOC '84.

[16]  Mihalis Yannakakis,et al.  High-Probability Parallel Transitive-Closure Algorithms , 1991, SIAM J. Comput..

[17]  Charles E. Leiserson,et al.  Area-Efficient Graph Layouts (for VLSI) , 1980, FOCS.

[18]  Michael Luby.  Removing randomness in parallel computation without a processor penalty , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[19]  Michael Luby,et al.  A simple parallel algorithm for the maximal independent set problem , 1985, STOC '85.

[20]  Gary L. Miller,et al.  A parallel algorithm for finding a separator in planar graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[21]  Philip N. Klein,et al.  A parallel randomized approximation scheme for shortest paths , 1992, STOC '92.