Skip to main navigation
Skip to search
Skip to main content
Tel Aviv University Home
Update Request & User Guide (TAU staff only)
Home
Experts
Research units
Research output
Prizes
Activities
Press/Media
Student theses
Search by expertise, name or affiliation
Single-source shortest paths in the CONGEST model with improved bounds
Shiri Chechik
, Doron Mukhtar
*
*
Corresponding author for this work
School of Computer Science
COMPUTER SCIENCE
Research output
:
Contribution to journal
›
Article
›
peer-review
6
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'Single-source shortest paths in the CONGEST model with improved bounds'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Shortest Path
100%
Forster
100%
Single-source Shortest Paths
100%
CONGEST Model
100%
First Improvement
50%
Number of Vertices
50%
Distributed Computing
50%
Improved Algorithm
50%
Randomized Algorithms
50%
Non-negative Integer
50%
Underlying Network
50%
Integer Weights
50%
Weighted Directed Graph
50%
Approximate Distances
50%
Triangle Inequality
50%
Polynomially Bounded
50%
Bellman-Ford Algorithm
50%
Computer Science
Distributed Computing
100%
Directed Graphs
100%
Randomized Algorithm
100%
Underlying Network
100%
Triangle Inequality
100%
Nonnegative Integer
100%
Bellman-Ford Algorithm
100%