Before revision:  As in Cabello's work, our algorithm can also computethe Wiener index of a planar graph (i.e., the sum of all pairwise distances)  within the same bound .
After revision:  As in Cabello's work, our algorithm can also computethe Wiener index of a planar graph (i.e., the sum of all pairwise distances) within the same time bounds .