Shortest path queries in planar graphs in constant time (2003)

by Lukasz Kowalik, Maciej Kurowski
Venue:In Proc. 35th Symposium Theory of Computing