Parallel Transitive Closure and Point Location in Planar Structures
- 1 August 1991
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 20 (4) , 708-725
- https://doi.org/10.1137/0220045
Abstract
No abstract availableKeywords
This publication has 33 references indexed in Scilit:
- Deterministic parallel list rankingPublished by Springer Nature ,2006
- Cascading Divide-and-Conquer: A Technique for Designing Parallel AlgorithmsSIAM Journal on Computing, 1989
- Algorithms for plane representations of acyclic digraphsTheoretical Computer Science, 1988
- Optimal Point Location in a Monotone SubdivisionSIAM Journal on Computing, 1986
- A linear algorithm for embedding planar graphs using PQ-treesJournal of Computer and System Sciences, 1985
- A new point-location algorithm and its practical efficiency: comparison with existing algorithmsACM Transactions on Graphics, 1984
- Representing a planar graph by vertical lines joining different levelsDiscrete Mathematics, 1983
- Parallel Algorithms in Graph Theory: Planarity TestingSIAM Journal on Computing, 1982
- A dichromatic framework for balanced treesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1978
- Organization and maintenance of large ordered indexesActa Informatica, 1972