Shortest paths in planar graphs with real lengths in O(nlog2n/loglogn) time

40 Citations (Scopus)

Fingerprint

Dive into the research topics of 'Shortest paths in planar graphs with real lengths in O(nlog2n/loglogn) time'. Together they form a unique fingerprint.

Keyphrases

Computer Science

Mathematics