ConceptSystems & CS
Parallel breadth-first search (BFS) work-span analysis
The parallel BFS algorithm has a span of and a total work of , making it a work-efficient algorithm.
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.