3
$\begingroup$

What is the time complexity of the fastest known algorithm for the all-pair shortest paths in planar graphs?

$\endgroup$
7
$\begingroup$

This can be done in quadratic time using the linear-time single-source shortest path algorithm by Henzinger et al.

$\endgroup$
  • $\begingroup$ Thank you.I would have voted you up if i could. $\endgroup$ – GEP Apr 2 '18 at 19:37

Your Answer

By clicking "Post Your Answer", you acknowledge that you have read our updated terms of service, privacy policy and cookie policy, and that your continued use of the website is subject to these policies.

Not the answer you're looking for? Browse other questions tagged or ask your own question.