Modules / Lectures
Module NameDownload

Sl.No Chapter Name English
1Lec01 - Introduction to Graph Theory - Part 1PDF unavailable
2Lec01 - Introduction to Graph Theory - Part 2PDF unavailable
3Lec02 - Introduction to Graph Algorithms - Part 1PDF unavailable
4Lec02 - Introduction to Graph Algorithms - Part 2PDF unavailable
5Lec03 - Havel Hakimi Theorem - Part 1PDF unavailable
6Lec03 - Havel Hakimi Theorem - Part 2PDF unavailable
7Lec03 - Havel Hakimi Theorem - Part 3PDF unavailable
8Lec04 - Graph Traversals - Part 1 PDF unavailable
9Lec04 - Graph Traversals - Part 2PDF unavailable
10Lec05 - Topological Sort and Mengers Theorem - Part 1PDF unavailable
11Lec05 - Topological Sort and Mengers Theorem - Part 2PDF unavailable
12Lec05 - Topological Sort and Mengers Theorem - Part 3PDF unavailable
13Lec06 - Hamiltonian Graphs - Part 1PDF unavailable
14Lec06 - Hamiltonian Graphs - Part 2PDF unavailable
15Lec07 - Shortest path Algorithms- 1 - Part 1PDF unavailable
16Lec07 - Shortest path Algorithms- 1 - Part 2PDF unavailable
17Lec07 - Shortest path Algorithms- 1 - Part 3PDF unavailable
18Lec07 - Shortest path Algorithms- 1 - Part 4PDF unavailable
19Lec08 - Matching in Graphs - Part 1PDF unavailable
20Lec08 - Matching in Graphs - Part 2PDF unavailable
21Lec09 - Some Graph Theoretic Puzzles - Part 1PDF unavailable
22Lec10 - Network Flow Algorithms - Part 1PDF unavailable
23Lec10 - Network Flow Algorithms - Part 2PDF unavailable
24Lec10 - Network Flow Algorithms - Part 3PDF unavailable
25Lec10 - Network Flow Algorithms - Part 4PDF unavailable
26Lec10 - Network Flow Algorithms - Part 5PDF unavailable
27Lec10 - Network Flow Algorithms - Part 6PDF unavailable
28Lec11 - Network Flows - Part 1PDF unavailable
29Lec11 - Network Flows - Part 2PDF unavailable
30Lec11 - Network Flows - Part 3PDF unavailable
31Lec11 - Network Flows - Part 4PDF unavailable
32Lec12 - Turan’s and Madrur’s theorem - Part 1PDF unavailable
33Lec12 - Turan’s and Madrur’s theorem - Part 2PDF unavailable
34Lec13 - NP Computations - Part 1PDF unavailable
35Lec13 - NP Computations - Part 2PDF unavailable
36Lec14 - Spectral Graph Theory - I - Part 1PDF unavailable
37Lec14 - Spectral Graph Theory - I - Part 2PDF unavailable
38Lec14 - Spectral Graph Theory - I - Part 3PDF unavailable
39Lec15 - NP Computations II - Part 1PDF unavailable
40Lec15 - NP Computations II - Part 2PDF unavailable
41Lec16 - Graph Coloring - Part 1PDF unavailable
42Lec16 - Graph Coloring - Part 2PDF unavailable
43Lec17 - Spectral Graph Theory - II - Part 1PDF unavailable
44Lec17 - Spectral Graph Theory - II - Part 2PDF unavailable
45Lec18 - NP Computations Reductions - Part 1PDF unavailable
46Lec18 - NP Computations Reductions - Part 2PDF unavailable
47Lec20 - Planar Graphs - Part 1PDF unavailable
48Lec20 - Planar Graphs - Part 2PDF unavailable
49Lec21 - NP Computations & Approximation Algorithms - Part 2PDF unavailable
50Lec22 - Spectral Graph Theory - IV - Part 1PDF unavailable
51Lec22 - Spectral Graph Theory - IV - Part 2PDF unavailable
52Lec23 - Approximation Algorithms I - Part 1PDF unavailable
53Lec23 - Approximation Algorithms I - Part 2PDF unavailable
54Lec24 - Social Network Analysis - Part 1PDF unavailable
55Lec24 - Social Network Analysis - Part 2PDF unavailable
56Lec25 Spectral Graph Theory -V - part 1PDF unavailable
57Lec25 Spectral Graph Theory -V - part 2PDF unavailable
58Lec26 - Approximation Algorithms II - part 1PDF unavailable
59Lec26 - Approximation Algorithms II - part 2PDF unavailable
60Lec27 - Spectral Graph Theory - VI - Part 1PDF unavailable
61Lec27 - Spectral Graph Theory - VI - Part 2PDF unavailable
62Lec28 - RSA Crypto - part 1PDF unavailable
63Lec28 - RSA Crypto - part 2PDF unavailable
64Lec29 - Approximation Algorithms III - part 1PDF unavailable
65Lec29 - Approximation Algorithms III - part 2PDF unavailable
66Lec30 - Spectral Graph Theory - VII - part 1PDF unavailable
67Lec30 - Spectral Graph Theory - VII - part 2PDF unavailable
68Lec31 - Exact Exponential Algorithms - part 1PDF unavailable
69Lec31 - Exact Exponential Algorithms - part 2PDF unavailable
70Lec32 - Interconnection Networks - part 1PDF unavailable
71Lec32 - Interconnection Networks - part 2PDF unavailable
72Lec33 - Kernelization - Part 1PDF unavailable
73Lec33 - Kernelization - Part 2PDF unavailable
74Lec34 - Introduction to Parameterized Algorithms - Part 1PDF unavailable
75Lec34 - Introduction to Parameterized Algorithms - Part 2PDF unavailable
76Lec35 - Chardal Graphs - part 1PDF unavailable
77Lec35 - Chardal Graphs - part 2PDF unavailable
78Lec36 - Branching - part 1PDF unavailable
79Lec36 - Branching - part 2PDF unavailable
80Lec37 - Interval Graphs and Split Graphs - part 1PDF unavailable
81Lec37 - Interval Graphs and Split Graphs - part 2PDF unavailable
82Lec38 - Vertex cover linear vertex kernel using LP - part 1PDF unavailable
83Lec38 - Vertex cover linear vertex kernel using LP - part 2PDF unavailable
84Lec39 - Comparability Graphs - part 1PDF unavailable
85Lec39 - Comparability Graphs - part 2PDF unavailable
86Lec41 - Probability Methods to Ramsey Number - Part 2PDF unavailable
87Lec41 - Probability Methods to Ramsey Number - Part 2PDF unavailable
88Lec42 - Color Coding - part 1PDF unavailable
89Lec42 - Color Coding - part 2PDF unavailable
90Lec43 - Fast Min-cut Algorithm and its analysis - part 1PDF unavailable
91Lec43 - Fast Min-cut Algorithm and its analysis - part 2PDF unavailable
92Lec44 - Box Representations of Graphs - part 1PDF unavailable
93Lec44 - Box Representations of Graphs - part 2PDF unavailable
94Lec45 - Hardness for FPT - part 1PDF unavailable
95Lec45 - Hardness for FPT - part 2PDF unavailable
96Lec46 - Application of min-cut Algorithm PDF unavailable


Sl.No Language Book link
1EnglishNot Available
2BengaliNot Available
3GujaratiNot Available
4HindiNot Available
5KannadaNot Available
6MalayalamNot Available
7MarathiNot Available
8TamilNot Available
9TeluguNot Available