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

Company

SIAM Journal / /

Currency

pence / /

/

Holiday

Assumption / /

IndustryTerm

improved network optimization algorithms / linear-time algorithm / almostlinear-time algorithms / linear-time algorithms / shortest-path algorithms / /

Person

Sairam Subramanian / MIN K EY / Philip Nathan Klein / Michael L. Fredman / Monika Rauch Henzinger / Satish Rao / Greg N. Frederickson / Robert Endre Tarjan / /

Position

R+ General / /

PublishedMedium

SIAM Journal on Computing / Journal of the ACM / /

TVStation

Wybe / /

Technology

almostlinear-time algorithms / SSSP algorithm / RAM / DFS tree Algorithm / Faster shortest-path algorithms / linear-time algorithm / linear-time algorithms / details SSSP Algorithm / Dijkstra SSSP algorithm / improved network optimization algorithms / /

SocialTag