Sign inSign in
ConceptSystems & CS

Parallel breadth-first search (BFS) work-span analysis

The parallel BFS algorithm has a span of Θ(Dlog⁡m)\Theta(D \log m) and a total work of Θ(n+m)\Theta(n + m), making it a work-efficient algorithm.
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.

Graph diameter1Prefix sum1Work and span definitions1

Lecturers

1

    Connections

    2

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

    Concept1

    Lecture1

    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.