Show simple item record

dc.contributor.authorTamassia, Roberto
dc.contributor.authorVitter, Jeffrey Scott
dc.date.accessioned2011-03-16T15:41:12Z
dc.date.available2011-03-16T15:41:12Z
dc.date.issued1991-08
dc.identifier.citationR. 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
dc.identifier.urihttp://hdl.handle.net/1808/7171
dc.descriptionAMS(MOS) subject classifications. 68E05, 68C05, 68C25
dc.description.abstractParallel 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.
dc.language.isoen_US
dc.publisherSociety for Industrial and Applied Mathematics
dc.subjectParallel algorithms
dc.subjectParallel computation
dc.subjectGraph algorithm
dc.subjectPlanar st-graphs
dc.subjectTransitive closure
dc.subjectReachability
dc.subjectPlanar point location
dc.subjectComputational geometry
dc.subjectFractional cascading
dc.subjectGraph drawing
dc.subjectVisibility
dc.titleParallel Transitive Closure and Point Location in Planar Structures
dc.typeArticle
kusw.kuauthorVitter, Jeffrey Scott
kusw.oastatusfullparticipation
dc.identifier.doi10.1137/0220045
kusw.oaversionScholarly/refereed, publisher version
kusw.oapolicyThis item meets KU Open Access policy criteria.
dc.rights.accessrightsopenAccess


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record