Faster shortest-path algorithms for planar graphs.
| Autor: | Klein, Philip, Rao, Satish, Rauch, Monika, Subramanian, Sairam |
|---|---|
| Zdroj: | Proceedings of the Twenty-Sixth Annual ACM Symposium: Theory of Computing; 5/23/1994, p27-37, 11p |
| Databáze: | Complementary Index |
| Externí odkaz: |
|