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
Datasets
Prizes
Activities
Press/Media
Search by expertise, name or affiliation
A forward-backward single-source shortest paths algorithm
David B. Wilson,
Uri Zwick
School of Computer Science
Microsoft USA
Research output
:
Contribution to journal
›
Article
›
peer-review
1
Scopus citations
Overview
Fingerprint
Fingerprint
Dive into the research topics of 'A forward-backward single-source shortest paths algorithm'. Together they form a unique fingerprint.
Sort by
Weight
Alphabetically
Keyphrases
Shortest Path Algorithm
100%
Forward-backward
100%
Single-source Shortest Paths
100%
Adjacency List
60%
Edge Weight
40%
High Probability
20%
Nondecreasing
20%
Complete Graph
20%
Expected Running Time
20%
Directed Graph
20%
All-pairs Shortest Paths
20%
Forward Scan
20%
Probability Bounds
20%
Dijkstra
20%
Mathematics
Edge
100%
Probability Theory
60%
Adjacency
60%
Running Time
40%
Independent Exponential
40%
Complete Graph
20%
Complete Directed Graph
20%
Computer Science
Shortest Path Algorithm
100%
Adjacency List
75%
Directed Graphs
25%
All-Pairs-Shortest-Paths Algorithm
25%