Sign inSign in

Breadth-first spanning trees

A distributed procedure where processes produce a breadth-first spanning tree rooted at a distinguished vertex.
Watch it explained

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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Nancy Ann Lynch

    MIT · Graduate

    • 49:06Synchronous Distributed Algorithms: Symmetry-Breaking and Shortest-Paths Spanning Trees

Connections

7

The lectures that define it or assume it, and the concepts next to it.

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.