1 paper
Zhidan Feng, Henning Fernau, Binhai Zhu
Given a road network modelled as a planar straight-line graph G=(V,E) with ∣V∣=n, let (u,v)∈V×V, the shortest path (distance) between u,v is denoted as δG(u,v).…