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
Computing the Maximum Detour of a Plane Graph in Subquadratic Time
Christian Wulff-Nilsen
Department of Computer Science
3
Citations (Scopus)
657
Downloads (Pure)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Computing the Maximum Detour of a Plane Graph in Subquadratic Time'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Plane Graph
100%
Computing
53%
Bounded Treewidth
34%
Line segment
30%
Fast Algorithm
28%
Distinct
20%