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
Solving the replacement paths problem for planar directed graphs in O(
n
log
n
) time
Christian Wulff-Nilsen
Department of Computer Science
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Solving the replacement paths problem for planar directed graphs in O(
n
log
n
) time'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Replacement
100%
Directed Graph
93%
Planar graph
90%
Shortest path
70%
Path
68%
Vertex of a graph
56%
Non-negative
22%
Computing
20%
Graph in graph theory
15%