Hypha

hypha

Lecture 11: Graphs and Coloring

1:21:15 Free

Graphs are incredibly useful structures in computer science. Their applications range from scheduling to communications to search engines. In this lecture, we look at several types of graphs and coloring.

Source: Zachary Abel, Mathematics for Computer Science (MIT: OpenCourseWare). Licensed under CC BY-NC-SA 4.0.

Hypha Official

Watch what matters. Create what pays.

MIT 6.1200J: Mathematics for Computer Science

This course covers elementary discrete mathematics for science and engineering, with a focus on mathematical tools and proof techniques useful in computer science. Topics include logical notation, sets, relations, elementary graph theory, state machines and invariants, induction and proofs by contradiction, recurrences, asymptotic notation, elementary analysis of algorithms, elementary number theory and cryptography, permutations and combinations, counting tools, and discrete probability.