Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Link opens in a new tab
Search content at University of Haifa
Home
Researchers
Research units
Research output
Fast 2-Approximate All-Pairs Shortest Paths
Michal Dory
, Sebastian Forster
, Yael Kirkpatrick
, Yasamin Nazari
, Virginia Vassilevska Williams
, Tijn de Vos
Department of Computer Science
Research output
:
Contribution to conference
›
Paper
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Fast 2-Approximate All-Pairs Shortest Paths'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
All-pairs Shortest Paths
100%
Sparse Graphs
60%
Rectangular Matrix multiplication
40%
Weighted Graph
40%
Unweighted Graph
40%
Constant Time
20%
Fast Algorithm
20%
Conditional Lower Bounds
20%
Combinatorial Algorithms
20%
Undirected Graph
20%
Subquadratic
20%
Distance Oracles
20%
Distance Computation
20%
Approximate Distance Oracles
20%
Approximate Query
20%
Distance Information
20%
Sparse Regime
20%
Graph Preserving
20%
Mathematics
Approximates
100%
Sparse Graphs
42%
Matrix Multiplication
28%
weighted graph
28%
Edge
14%
Fast Algorithm
14%
Wide Range
14%
Conditionals
14%
Combinatorial Algorithm
14%
Constant Time
14%
Path Problem
14%