3
$\begingroup$

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

Improve this question
$\endgroup$

1 Answer 1

Reset to default
7
$\begingroup$

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

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

You must log in to answer this question.

Not the answer you're looking for? Browse other questions tagged .