A linear-processor polylog-time algorithm for shortest paths in planar graphs

Philip N. Klein, Sairam Subramanian

Browse the full FOCS paper archive.