Efficient parallel shortest-paths in digraphs with a separator decomposition
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
Hi-index | 0.00 |