Preprocessing an undirected planar network to enable fast approximate distance queries
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Compact oracles for reachability and approximate distances in planar digraphs
Journal of the ACM (JACM)
Hi-index | 0.00 |