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)
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
Keyphrases
Subquadratic
100%
Plane Graph
100%
Expected Running Time
33%
Expected Time
33%
Bounded Treewidth
33%
Number of Vertices
33%
Mathematics
Running Time
100%
Plane Graph
100%
Distinct Point
50%
Line Segment
50%