Towards overcoming the transitive-closure bottleneck: efficient parallel algorithms for planar digraphs
- 1 January 1990
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 181-192
- https://doi.org/10.1145/100216.100237
Abstract
No abstract availableThis publication has 0 references indexed in Scilit: