Skip to main content
Graph
Search
fr
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Quizes
Exercises
Publications
Startups
Units
Show all results for
Home
Lecture
Max-Flow Min-Cut
Graph Chatbot
Related lectures (31)
Complex Systems: Critical Phenomena
Explores critical phenomena in complex systems, including stochastic objects, percolation, and combinatorial optimization.
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.
Theory of Computability: Solvability and Complexity
Explores the theory of computability, decision problems, complexity classes, and the 'P vs. NP' conundrum.
Elements of Computational Complexity
Covers quantum algorithms, complexity classes, Grover's algorithm, and quantum information in computational complexity.
Elements of Computational Complexity
Introduces computational complexity, decision problems, quantum complexity, and probabilistic algorithms, including NP-hard and NP-complete problems.
P vs NP: Complexity Theory
Delves into complexity theory, focusing on the P vs NP problem and the classification of computational problems based on efficiency.
Cryptanalysis: Public-Key & The Power of Interaction
Explores cryptanalysis in public-key systems and the power of interaction in interactive proofs, covering CO-NP, NP classes, P vs. NP, and more.
Computational Complexity
Covers the basics of computational complexity, including big O notation and complexity classes.
The Transhipment Problem: Standard Form
MOOC: Optimization: principles and algorithms - Network and discrete optimization
Covers the linear optimization problem of the transhipment model.
Density Operator Formalism
Covers the density operator formalism, polynomial time, NP problems, BPP, QMA, and probabilistic algorithms.
Complexity of Algorithms: Big-O Notation
Explores algorithm complexity, big-O notation, induction, recursion, and analysis of running times, covering NP problems and complexity classes.
Knapsack Problem: Optimization and Traveling Salesman
Explores the knapsack problem and the traveling salesman problem with a focus on optimization algorithms.
Theory of Computation: NP Complexity
Delves into oracles, certificates, and the NP complexity class, raising the fundamental P versus NP question.
Complexity & Induction: Algorithms & Proofs
Covers worst-case complexity, algorithms, and proofs including mathematical induction and recursion.
Understanding Complexity: Tractable Problems and NP-Complete
Covers complexity classes, effect on computer time, tractable problems, class NP, and NP-complete problems.
Complexity of Algorithms: Proofs of Time Complexity
Covers the analysis of worst time complexity for algorithms and time complexity with real numbers and integers.
Graph Theory and Network Flows
Log in to Mediaspace to watch this video
Introduces graph theory, network flows, and flow conservation laws with practical examples and theorems.
Optimization Algorithms
Log in to Mediaspace to watch this video
Covers optimization algorithms, convergence properties, and time complexity of sequences and functions.
Network Flow Algorithms
Log in to Mediaspace to watch this video
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.
Previous
Page 1 of 2
Next
