Learn · ACM Summer School On Graph Theory and Graph Algorithms,2018 - Coimbatore
Lecture 11 of 103ACM Summer School On Graph Theory and Graph Algorithms - Coimbatore
Lec05 - Topological Sort and Mengers Theorem - Part 2
IIT Madras
Credits and licence
- From
- ACM Summer School On Graph Theory and Graph Algorithms,2018 - Coimbatore, IIT Madras (at NPTEL)
- Licence
- CC BY-NC-SA, as NPTEL states it. Non-commercial use only.
- Attribution
- NPTEL states: "Distributed under Creative Commons Attribution-ShareAlike / CC BY - NC - SA", beside a BY-NC-SA badge.
- Who can watch
- Tweens profiles and older. How courses are placed
All the lectures
- Lec01 - Introduction to Graph Theory - Part 1
- Lec01 - Introduction to Graph Theory - Part 2
- Lec02 - Introduction to Graph Algorithms - Part 1
- Lec02 - Introduction to Graph Algorithms - Part 2
- Lec03 - Havel Hakimi Theorem - Part 1
- Lec03 - Havel Hakimi Theorem - Part 2
- Lec03 - Havel Hakimi Theorem - Part 3
- Lec04 - Graph Traversals - Part 1
- Lec04 - Graph Traversals - Part 2
- Lec05 - Topological Sort and Mengers Theorem - Part 1
- Lec05 - Topological Sort and Mengers Theorem - Part 2
- Lec05 - Topological Sort and Mengers Theorem - Part 3
- Lec06 - Hamiltonian Graphs - Part 1
- Lec06 - Hamiltonian Graphs - Part 2
- Lec07 - Shortest path Algorithms- 1 - Part 1
- Lec07 - Shortest path Algorithms- 1 - Part 2
- Lec07 - Shortest path Algorithms- 1 - Part 3
- Lec07 - Shortest path Algorithms- 1 - Part 4
- Lec08 - Matching in Graphs - Part 1
- Lec08 - Matching in Graphs - Part 2
- Lec09 - Some Graph Theoretic Puzzles - Part 1
- Lec09 - Some Graph Theoretic Puzzles - Part 2
- Lec10 - Network Flow Algorithms - Part 1
- Lec10 - Network Flow Algorithms - Part 2
- Lec10 - Network Flow Algorithms - Part 3
- Lec10 - Network Flow Algorithms - Part 4
- Lec10 - Network Flow Algorithms - Part 5
- Lec10 - Network Flow Algorithms - Part 6
- Lec11 - Network Flows - Part 1
- Lec11 - Network Flows - Part 2
- Lec11 - Network Flows - Part 3
- Lec11 - Network Flows - Part 4
- Lec12 - Turan's and Madrur's theorem - Part 1
- Lec12 - Turan's and Madrur's theorem - Part 2
- Lec13 - NP Computations - Part 1
- Lec13 - NP Computations - Part 2
- Lec14 - Spectral Graph Theory - I - Part 1
- Lec14 - Spectral Graph Theory - I - Part 2
- NP Computations II - Part 1
- NP Computations II - Part 2
- Graph Coloring - Part 1
- Graph Coloring - Part 2
- Spectral Graph Theory - II - Part 1
- Spectral Graph Theory - II - Part 2
- NP Computations Reductions - Part 1
- NP Computations Reductions - Part 2
- NP Computations Reductions - Part 3
- Spectral Graph Theory - III - Part 1
- Spectral Graph Theory - III - Part 2
- Planar Graphs - Part 1
- Planar Graphs - Part 2
- NP Computations & Approximation Algorithms - Part 1
- NP Computations & Approximation Algorithms - Part 2
- Spectral Graph Theory - IV - Part 1
- Spectral Graph Theory - IV - Part 2
- Approximation Algorithms I - Part 1
- Approximation Algorithms I - Part 2
- Social Network Analysis - Part 1
- Social Network Analysis - Part 2
- Spectral Graph Theory -V - part 1
- Spectral Graph Theory -V - part 2
- Approximation Algorithms II - part 1
- Approximation Algorithms II - part 2
- Spectral Graph Theory - VI - Part 1
- Spectral Graph Theory - VI - Part 2
- RSA Crypto - part 1
- RSA Crypto - part 2
- Approximation Algorithms III - part 1
- Approximation Algorithms III - part 2
- Spectral Graph Theory - VII - part 1
- Spectral Graph Theory - VII- part 2
- Exact Exponential Algorithms - part 1
- Exact Exponential Algorithms - part 2
- Interconnection Networks - part 1
- Interconnection Networks - part 2
- Kernelization - Part 1
- Kernelization - Part 2
- Kernelization - Part 3
- Introduction to Parameterized Algorithms - Part 1
- Introduction to Parameterized Algorithms - Part 2
- Chardal Graphs - part 1
- Chardal Graphs - part 2
- Branching - part 1
- Branching - part 2
- Interval Graphs and Split Graphs - part 1
- Interval Graphs and Split Graphs - part 2
- Vertex cover linear vertex kernel using LP - part 1
- Vertex cover linear vertex kernel using LP - part 2
- Comparability Graphs - part 1
- Comparability Graphs - part 2
- Introduction to Randomized Algorithms and Karger's Min-cut Algorithm - part 1
- Introduction to Randomized Algorithms and Karger's Min-cut Algorithm - part 2
- Probability Methods to Ramsey Number - Part 1
- Probability Methods to Ramsey Number - Part 2
- Color Coding - part 1
- Color Coding - part 2
- Fast Min-cut Algorithm and its analysis - part 1
- Fast Min-cut Algorithm and its analysis - part 2
- Box Representations of Graphs - part 1
- Box Representations of Graphs - part 2
- Hardness for FPT - part 1
- Hardness for FPT - part 2
- Application of min-cut Algorithm