Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Max-Flow Min-Cut
Graph Chatbot
Related lectures (30)
Previous
Page 1 of 3
Next
Complex Systems: Critical Phenomena
Explores critical phenomena in complex systems, including stochastic objects, percolation, and combinatorial optimization.
Graph Theory and Network Flows
Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.
Complexity Classes: P and NP
Explores complexity classes P and NP, highlighting solvable and verifiable problems, including NP-complete challenges.
Computational Complexity: Theory and Applications
Explores computational complexity, NP-completeness, and polynomial reductions in theoretical computer science.
Optimization Algorithms
Covers optimization algorithms, convergence properties, and time complexity of sequences and functions.
Theory of Computability: Solvability and Complexity
Explores the theory of computability, decision problems, complexity classes, and the 'P vs. NP' conundrum.
Network Flow Algorithms
Covers network flow algorithms, including Max Flow, Min Cut, and Negative Cost Cycle Algorithm, progressing from basic definitions to advanced algorithms like Bellman-Ford and Dijkstra's.
Expander Graphs: Properties and Eigenvalues
Explores expanders, Ramanujan graphs, eigenvalues, Laplacian matrices, and spectral properties.
Theory of Computation: Decidability and Complexity
Delves into the theory of computation, covering decidability, complexity, P vs. NP, and reductions.
Ramanujan Graphs: Generating Functions and Expander Graphs
Explores Ramanujan graphs, generating functions, non-backtracking walks, and expander graphs in relation to NP-hard problems.
