IIT Madras · Computer Science

ACM Summer School On Graph Theory and Graph Algorithms,2018 - Coimbatore

103 free video lectures

103 video lectures. Topics: Introduction to Graph Theory - Part 1; Introduction to Graph Theory - Part 2; Introduction to Graph Algorithms - Part 1; Introduction to Graph Algorithms - Part 2; Havel Hakimi Theorem - Part 1; Havel Hakimi Theorem - Part 2; Havel Hakimi Theorem - Part 3; Graph…

▶ Play on Open Lecture HallCourse page ↗

Lectures

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

From NPTEL (IITs and IISc) · CC BY-NC-SA. More from IIT Madras.

Open Lecture Hall is free, with no ads and no sign-up. It is not run by or connected to any university; the lectures are the universities' own free recordings, played from where they host them. About & rights