ConceptTheory & Algos
Asynchronous Bellman-Ford
An asynchronous relaxation algorithm used to compute shortest paths trees that handles both long small-weight paths and fast-traveling information due to asynchrony.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
2The lectures that define it or assume it, and the concepts next to it.