Back to Results
First PageMeta Content
Network theory / Shortest path problem / Fibonacci heap / Binary logarithm / Mathematics / Graph theory / Theoretical computer science


6.889 — Lecture 4: Single-Source Shortest Paths Christian Sommer September 19 and 26, 2011 Single-Source Shortest Path (SSSP) Problem: given a graph G = (V, E) and a source vertex s ∈ V , compute shortes
Add to Reading List

Document Date: 2011-09-26 10:03:02


Open Document

File Size: 151,14 KB

Share Result on Facebook
UPDATE