Loading...
Parallel Transitive Closure and Point Location in Planar Structures
Tamassia, Roberto Vitter, Jeffrey Scott
Tamassia, Roberto
Vitter, Jeffrey Scott
Citations
Altmetric:
Abstract
Parallel algorithms for several graph and geometric problems are presented, including transitive closure and topological sorting in planar st-graphs, preprocessing planar subdivisions for point location queries, and construction of visibility representations and drawings of planar graphs.
Most of these algorithms achieve optimal O(logn) running time using n/logn processors in the EREW PRAM model, n being the number of vertices.
Description
AMS(MOS) subject classifications. 68E05, 68C05, 68C25
Date
1991-08
Journal Title
Journal ISSN
Volume Title
Publisher
Society for Industrial and Applied Mathematics
Files
Loading...
vitter_1991.pdf
Adobe PDF, 2.29 MB
Research Projects
Organizational Units
Journal Issue
Keywords
Parallel algorithms, Parallel computation, Graph algorithm, Planar st-graphs, Transitive closure, Reachability, Planar point location, Computational geometry, Fractional cascading, Graph drawing, Visibility
Citation
R. Tamassia and J. S. Vitter. “Parallel Transitive Closure and Point Location in Planar Structures,” SIAM Journal on Computing, 20(4), August 1991, 708–725. An extended abstract appears in “Optimal Parallel Algorithms for Transitive Closure and Point Location in Planar Structures,” Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures (SPAA ’89), Sante Fe, NM, June 1989, 399–408. Also appears as an invited paper in Proceedings of the International Workshop on Discrete Algorithms and Complexity, Fukuoka, Japan, November 1989, 169–178. http://dx.doi.org/10.1137/0220045