6.852J | Fall 2009 | Graduate

Distributed Algorithms

Lecture Notes

Class 9

Description:

Lecture presentation on basic asynchronous network algorithms, constructing a spanning tree, breadth-first search, shortest paths, and minimum spanning trees.

Resource Type:
Lecture Notes

Course Info

Instructor
As Taught In
Fall 2009
Level
Learning Resource Types
Problem Sets
Lecture Notes