Skip to main navigation
Skip to search
Skip to main content
University of Copenhagen Research Portal Home
Help & FAQ
Dansk
English
Home
Profiles
Research output
Research units
Press/Media
Activities
Prizes
???studenttheses???
Datasets
Search by expertise, name or affiliation
Shortest paths in planar graphs with real lengths in
O
(
n
log
2
n
/loglog
n
) time
Shay Mozes,
Christian Wulff-Nilsen
Department of Computer Science
40
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Shortest paths in planar graphs with real lengths in
O
(
n
log
2
n
/loglog
n
) time'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Negative Cycle
100%
Planar Graph
100%
Single-source Shortest Paths
100%
Shortest Path
100%
Edge Length
100%
Directed Graph
100%
Shortest Path Distance
100%
Log-log
100%
Computer Science
Directed Graph
100%
Planar Graph
100%
Mathematics
Edge
100%
Planar Graph
100%