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
More compact oracles for approximate distances in undirected planar graphs
Ken-ichi Kawarabayashi, Christian Sommer,
Mikkel Thorup
Department of Computer Science
17
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'More compact oracles for approximate distances in undirected planar graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Approximate Distance Oracles
50%
Time-space Tradeoff
25%
Shortest Distance Query
25%
Approximate Answer
25%
Distance Query
25%
Shortest Path Query
25%
First Improvement
25%
Polynomial Dependence
25%
Space Products
25%
Computer Science
Planar Graph
100%
Space Requirement
33%
Data Structure
33%
Mathematics
Product Space
20%