ConceptTheory & Algos
Asynchronous relaxation-based BFS algorithm (second Attempt)
A relaxation-based algorithm similar to Bellman-Ford where processes track hop distance and update their parent pointer upon discovering a shorter path to correct for asynchrony errors.
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
3The lectures that define it or assume it, and the concepts next to it.