Video Lectures, Video Courses, Science Animations, Lecture Notes, Online Test, Lecture Presentations. Absolutely FREE.

video courses
Video Lecture Description Sub-Category Time Click to view video

Back to Computer-Science Video Lecture Course Page
Mod-01 Lec-01 Introduction: Vertex cover and independent set Computer Science 56 min Click to view videos
Mod-01 Lec-02 Matchings: Konigs theorem and Halls theorem Computer Science 58 min Click to view videos
Mod-01 Lec-03 More on Halls theorem and some applications Computer Science 58 min Click to view videos
Mod-01 Lec-04 Tuttes theorem on existence of a perfect matching Computer Science 58 min Click to view videos
Mod-01 Lec-05 More on Tuttes theorem Computer Science 58 min Click to view videos
Mod-01 Lec-06 More on Matchings Computer Science 58 min Click to view videos
Mod-01 Lec-07 Dominating set, path cover Computer Science 59 min Click to view videos
Mod-01 Lec-08 Gallai -- Millgram theorem, Dilworths theorem Computer Science 58 min Click to view videos
Mod-02 Lec-09 Connectivity: 2-connected and 3- connected graphs Computer Science 58 min Click to view videos
Mod-02 Lec-10 Mengers theorem Computer Science 56 min Click to view videos
Mod-02 Lec-11 More on connectivity: k- linkedness Computer Science 55 min Click to view videos
Mod-02 Lec-12 Minors, topological minors and more on k- linkedness Computer Science 56 min Click to view videos
Mod-03 Lec-13 Vertex coloring: Brooks theorem Computer Science 57 min Click to view videos
Mod-03 Lec-14 More on vertex coloring Computer Science 56 min Click to view videos
Mod-03 Lec-15 Edge coloring: Vizings theorem Computer Science 57 min Click to view videos
Mod-03 Lec-16 Proof of Vizings theorem, Introduction to planarity Computer Science 57 min Click to view videos
Mod-03 Lec-17 5- coloring planar graphs, Kuratowskys theorem Computer Science 58 min Click to view videos
Mod-03 Lec-18 Proof of Kuratowskys theorem, List coloring Computer Science 57 min Click to view videos
Mod-03 Lec-19 List chromatic index Computer Science 58 min Click to view videos
Mod-03 Lec-20 Adjacency polynomial of a graph and combinatorial Nullstellensatz Computer Science 57 min Click to view videos
Mod-03 Lec-21 Chromatic polynomial, k - critical graphs Computer Science 57 min Click to view videos
Mod-03 Lec-22 Gallai-Roy theorem, Acyclic coloring, Hadwigers conjecture Computer Science 54 min Click to view videos
Mod-04 Lec-23 Perfect graphs: Examples Computer Science 57 min Click to view videos
Mod-04 Lec-24 Interval graphs, chordal graphs Computer Science 57 min Click to view videos
Mod-04 Lec-25 Proof of weak perfect graph theorem (WPGT) Computer Science 57 min Click to view videos
Mod-04 Lec-26 Second proof of WPGT, Some non-perfect graph classes Computer Science 58 min Click to view videos
Mod-04 Lec-27 More special classes of graphs Computer Science 58 min Click to view videos
Mod-04 Lec-28 Boxicity,Sphericity, Hamiltonian circuits Computer Science 57 min Click to view videos
Mod-04 Lec-29 More on Hamiltonicity: Chvatals theorem Computer Science 58 min Click to view videos
Mod-04 Lec-30 Chvatals theorem, toughness, Hamiltonicity and 4-color conjecture Computer Science 59 min Click to view videos
Mod-05 Lec-31 Network flows: Max flow mincut theorem Computer Science 58 min Click to view videos
Mod-05 Lec-32 More on network flows: Circulations Computer Science 59 min Click to view videos
Mod-05 Lec-33 Circulations and tensions Computer Science 58 min Click to view videos
Mod-05 Lec-34 More on circulations and tensions, flow number and Tuttes flow conjectures Computer Science 57 min Click to view videos
Mod-06 Lec-35 Random graphs and probabilistic method: Preliminaries Computer Science 57 min Click to view videos
Mod-06 Lec-36 Probabilistic method: Markovs inequality, Ramsey number Computer Science 58 min Click to view videos
Mod-06 Lec-37 Probabilistic method: Graphs of high girth and high chromatic number Computer Science 58 min Click to view videos
Mod-06 Lec-38 Probabilistic method: Second moment method, Lovasz local lemma Computer Science 59 min Click to view videos
Mod-07 Lec-39 Graph minors and Hadwigers conjecture Computer Science 58 min Click to view videos
Mod-07 Lec-40 More on graph minors, tree decompositions Computer Science 59 min Click to view videos

Bookmark with DeliciousBookmark with DiggBookmark with FacebookBookmark with GoogleBookmark with StumbleUponBookmark with TechnoratiBookmark with LinkedinBookmark with RedditLearnersTV on Twitter