Lecture
Network Flow Algorithms
Related lectures (42)
Process Unit Models: Degrees of Freedom
Explores process unit modeling, balance equations, degrees of freedom, and flowsheet solving.
Isogenic Graphs: Spectral Analysis and Mathematical Applications
Explores isogenic graphs, spectral properties, and mathematical applications in modular forms and cryptography.
Maximum Flow: Theory and Applications
Explores maximum flow in graphs, covering Ford-Fulkerson algorithm, flow conservation, and minimum cut.
Graph Algorithms: Basics
Introduces the basics of graph algorithms, covering traversal, representation, and data structures for BFS and DFS.
Network Simulation and Activity Dynamics
Explores neural network simulation, activity dynamics, and validation processes to ensure accurate predictions.
Hidden Subgroup Algorithm
Continues the discussion on Simon's hidden subgroup problem, focusing on finding a basis.
Elements of computational complexity
Covers classical and quantum computational complexity concepts and implications.
Belief Propagation: Key Methods and Analysis
Covers Belief Propagation, a key method for both analysis and algorithm.
Graph Algorithms: BFS and DFS
Explores graph algorithms like BFS and DFS, discussing shortest paths, spanning trees, and data structures' role.
Metropolis-Hastings Algorithm
Covers the Metropolis-Hastings and Glauber algorithms for sampling from the Boltzmann distribution in the Curie-Weiss model.