Skip to main navigation
Skip to search
Skip to main content
University of Haifa Home
Update your profile
Home
Researchers
Research units
Research output
Search by expertise, name or affiliation
Approximate shortest paths in weighted graphs
Raphael Yuster
Department of Mathematics
Research output
:
Contribution to journal
›
Article
›
peer-review
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Approximate shortest paths in weighted graphs'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Mathematics
Shortest path
100%
Weighted Graph
99%
Shortest Path Problem
47%
Directed Graph
35%
Path Length
23%
Matrix multiplication
22%
Exact Algorithms
21%
Integer
19%
Approximation Algorithms
16%
Requirements
15%
Exponent
14%
Generalise
10%
Approximation
9%
Graph in graph theory
8%
Engineering & Materials Science
Directed graphs
36%
Approximation algorithms
17%