Parallel Transitive Closure and Point Location in Planar Structures
View/
Issue Date
1991-08Article Version
Scholarly/refereed, publisher version
Metadata
Show full item recordAbstract
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
Collections
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
Items in KU ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
