Finding small simple cycle separators for 2-connected planar graphs
Journal of Computer and System Sciences
A simple parallel algorithm for the maximal independent set problem
SIAM Journal on Computing
Efficient parallel solution of linear systems
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
SFCS '80 Proceedings of the 21st Annual Symposium on Foundations of Computer Science
Parallel tree contraction and its application
SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
Separator-based strategies for efficient message routing
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
| Hi-index | 0.00 |
We present a randomized parallel algorithm for finding a simple cycle separator in a planar graph. The size of the separator is O(√n) and it separates the graph so that the largest part contains at most 2/8 ċ n vertices. Our algorithm takes T = O(log2(n)) time and P = O(n + f1+ε) processors, where n is the number of vertices, f is the number of faces and ε is any positive constant. The algorithm is based on the solution of Lipton and Tarjan [8] for the sequential case which takes O(n) time. Combining our algorithm with the Pan and Reif [12] algorithm, enables us to find a BFS of planar graph in time O(log3(n)) using n1.5/log(n) processors. Using a variation of our algorithm we can construct a simple cycle separator of size O(d ċ √f) were d is maximum face size.