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
Search by expertise, name or affiliation
On dynamic shortest paths problems
Liam Roditty
*
,
Uri Zwick
*
Corresponding author for this work
School of Computer Science
Bar-Ilan University
Research output
:
Contribution to journal
›
Article
›
peer-review
98
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'On dynamic shortest paths problems'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Undirected Weighted Graph
100%
All-pairs Shortest Paths
100%
Single-source Shortest Paths
100%
Dynamic Shortest Path Problem
100%
Decremental
50%
Unweighting
50%
SIMPLE Algorithm
50%
Time Algorithm
50%
Sqrt
50%
Update Time
50%
Fully Dynamic Algorithm
50%
Shortest-path Tree
50%
Shortest Path Problem
50%
Query Response Time
50%
Weighted Directed Graph
50%
Unweighted Graph
50%
Computer Science
Shortest Path Problem
100%
Directed Graphs
100%
Pair Shortest Path Problem
66%
Simple Algorithm
33%
Shortest Path Tree
33%