Parallel transitive closure and point location in planar structures (1991)
by
Roberto Tamassia
,
Jeffrey S. Vitter
| Venue: | SIAM J. COMPUT |
| Citations: | 22 - 11 self |
BibTeX
@ARTICLE{Tamassia91paralleltransitive,
author = {Roberto Tamassia and Jeffrey S. Vitter},
title = {Parallel transitive closure and point location in planar structures},
journal = {SIAM J. COMPUT},
year = {1991},
volume = {20},
pages = {708--725}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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(log n) running time using n = log n processors in the EREW PRAM model, n being the number of vertices.
