OLHOpen Lecture Hall

Home / Lectures / Mathematics for Computer Science

Still from the lecture

Mathematics

Lecture 8: Graph Theory II: Minimum Spanning Trees

Course: Mathematics for Computer Science
Instructor: Prof. Tom Leighton
Department: Electrical Engineering and Computer Science
Recorded: Fall 2010
Level: Undergraduate

▶ Watch the lecture

Free account required. The lecture opens at MIT OpenCourseWare.

About this lecture

Explores the various measures of connectivity of graphs and how these can be used to categorize and analyze graphs.

← Lecture 7: Matching Problems Lecture 9: Communication Networks →

More in Mathematics

Still from the lecture “Lecture 1: The geometry of linear equations”

Lecture 1: The geometry of linear equations

Linear Algebra · Prof. Gilbert Strang

Still from the lecture “Lecture 2: Elimination with matrices”

Lecture 2: Elimination with matrices

Linear Algebra · Prof. Gilbert Strang

Still from the lecture “Lecture 3: Multiplication and inverse matrices”

Lecture 3: Multiplication and inverse matrices

Linear Algebra · Prof. Gilbert Strang