ConceptTheory & Algos
Minimum spanning tree (M.S.T.) algorithms
Graph algorithms that compute the minimum spanning tree, with the fastest probabilistic algorithm running in linear time.
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.