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
Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time
Christian Wulff-Nilsen
3
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Constant time distance queries in planar unweighted graphs with subquadratic preprocessing time'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Time Distance
100%
Constant Time
100%
Subquadratic
100%
Unweighted Graph
100%
Space Constraints
66%
Oracle
33%
Large Classes
33%
Linear Space
33%
All-pairs Shortest Paths
33%
Time Requirement
33%
Wiener Index
33%
Shortest Path Distance
33%
Planar Undirected Graphs
33%
Computer Science
Space Requirement
100%
Preprocessing Time
100%
Time Requirement
50%