J. Gudmundsson, C. Levcopoulos, G. Narasimhan and M. Smid. Approximate Distance Oracles for Geometric graphs. In Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Approximate Distance Oracles Revisited - Gudmundsson, Levcopoulos.. (2002) (2 citations) Self-citation (Gudmundsson Levcopoulos Narasimhan Smid) (Correct)
No context found.
J. Gudmundsson, C. Levcopoulos, G. Narasimhan and M. Smid. Approximate Distance Oracles for Geometric graphs. In Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, 2002.
Well-Separated Pair Decomposition for the Unit-Disk Graph.. - Gao, Zhang (2003) (Correct)
No context found.
J. Gudmundsson, C. Levcopoulos, G. Narasimhan, and M. Smid. Approximate distance oracles for geometric graphs. In Proc. 13th ACM-SIAM Symposium on Discrete Algorithms, pages 828--837, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC