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
Mathematics
Preprocessing
100%
Time Constant
99%
Query
85%
Planar graph
78%
Requirements
23%
Wiener Index
17%
Shortest path
15%
Oracle
15%
Linear Space
14%
Undirected Graph
13%
Minor
13%
Graph in graph theory
13%
Open Problems
11%
Vertex of a graph
8%
Generalise
7%
Class
4%