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
A new infinity of distance oracles for sparse graphs
Mihai Patrascu, Liam Roditty,
Mikkel Thorup
Department of Computer Science
24
Citations (Scopus)
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A new infinity of distance oracles for sparse graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Stretch
100%
Sparse Graphs
98%
Oracle
87%
Infinity
56%
Integer
18%
Trade-offs
14%
Hardness
13%
Query
13%
Intersection of sets
10%
Fractional
9%
Time Constant
7%
Weighted Graph
7%
Undirected Graph
6%
Consecutive
6%
Estimate
6%
Multiplicative
5%
Odd
4%
Lower bound
4%
Upper bound
4%
Arbitrary
3%
Approximation
3%
Graph in graph theory
3%