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
Girth of a Planar Digraph with Real Edge Weights in O(
n
log
3
n
) Time.
Christian Wulff-Nilsen
Department of Computer Science
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Girth of a Planar Digraph with Real Edge Weights in O(
n
log
3
n
) Time.'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Edge Weight
100%
Planar Digraphs
100%
Negative Edges
33%
Space Bound
33%
Girth of a Graph
33%
Mathematics
Edge
100%