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

by Łukasz Kowalik
Venue:In STOC’03
Citations:6 - 2 self