3
$\begingroup$

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

$\endgroup$

1 Answer 1

7
$\begingroup$

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

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

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

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