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
Faster shortest paths in dense distance graphs, with applications
Shay Mozes
, Yahav Nussbaum
,
Oren Weimann
Department of Computer Science
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Faster shortest paths in dense distance graphs, with applications'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Arc Length
12%
Boundary Vertex
25%
Dijkstra
12%
Dijkstra Algorithm
25%
Distance Graph
100%
Flow Path
12%
Linear Time
12%
Linear-time Algorithm
12%
Maximum Flow
37%
Minimum Cut
25%
Minimum number
12%
Number of Edges
12%
Planar Graph
62%
Planar Graph Algorithms
12%
Rao Algorithms
12%
Regional Boundary
12%
Shortest Path
100%
Shortest Path Algorithm
25%
Vertex Set
12%
Computer Science
Boundary Vertex
25%
Dijkstra Algorithms
25%
Distance Graph
100%
Graph Algorithms
12%
Planar Graph
75%
Research Agenda
12%
Shortest Path Algorithm
25%
Mathematics
Arc Length
16%
Edge
16%
Graph Algorithm
16%
Linear Time
33%
Planar Graph
100%
Research Agenda
16%
Running Time
16%