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
Keyphrases
All-pairs Shortest Paths
100%
Weighted Graph
100%
Approximate Shortest Paths
100%
Approximation Algorithms
33%
Number of Vertices
33%
Directed Graph
33%
Negative Weight
33%
Weighted Directed Graph
33%
Additive Error
33%
Matrix multiplication
33%
Positive Weights
33%
Exact Algorithm
33%
Positive Realness
33%
Weighted Instance
33%
Additive Approximation
33%
Absolute Weight
33%
Computer Science
Pair Shortest Path Problem
100%
Directed Graphs
100%
weighted graph
100%
Approximation (Algorithm)
50%
Pair Shortest Path
50%
Matrix Multiplication
50%
Approximation Algorithms
50%
Negative Weight
50%
Positive Weight
50%
Exact Algorithm
50%
Independent Constant
50%
Mathematics
Integer
100%
Approximates
100%
weighted graph
100%
Path Problem
100%
Matrix Multiplication
50%
Additive Error
50%
Independent Constant
50%