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
Maximizing Candies in a City
Graph Chatbot
Related lectures (31)
Graph Algorithms II: Traversal and Paths
Explores graph traversal methods, spanning trees, and shortest paths using BFS and DFS.
Matrix Tree Theorem
Explores the Matrix Tree Theorem and its application in calculating spanning trees in graphs.
Prim's and Kruskal's Algorithms
Explores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.
Optimization with Constraints: KKT Conditions
Covers the KKT conditions for optimization with constraints, essential for solving constrained optimization problems efficiently.
Shortest Paths: Negative Weights & Applications
Covers Minimum Spanning Trees, Kruskal's Algorithm, and Shortest Paths in directed graphs.
Minimum Spanning Trees: Prim's Algorithm
Explores Prim's algorithm for minimum spanning trees and introduces the Traveling Salesman Problem.
Networks: Trees
MOOC: Optimization: principles and algorithms - Network and discrete optimization
Explains the concept of trees in graph theory and the definition of a spanning tree.
Connectivity in Graph Theory
Covers the fundamentals of connectivity in graph theory, including paths, cycles, and spanning trees.
Algorithms: Union Find and Minimum Spanning Trees
Discusses Union-Find data structures and Minimum Spanning Trees, covering algorithms and their applications in network design and optimization.
Subgraphs vs Induced Subgraphs
Distinguishes between subgraphs and induced subgraphs in graph theory, illustrating the construction of minimal spanning trees.
Constraint Satisfaction: Formulation and Algorithms
Covers the formulation of constraint satisfaction problems and systematic algorithms for solving them efficiently.
Effort Informed Roadmaps: Efficient Multiquery Planning with EIRM*
Introduces EIRM*, a planner that efficiently solves multiple planning problems by reusing information and managing graph size effectively.
Efficiency & Decoupling: Understanding Environmental Impact
Delves into efficiency, decoupling, and environmental impact assessment, highlighting the complexities of balancing economic growth and environmental sustainability.
Energy Systems Optimization
Explores energy systems modeling, optimization, and cost analysis for efficient operations.
Efficiency and Yield
Explores efficiency and yield in the Carnot cycle, including thermal machines and engine cycles, with practical exercises on temperature calculations.
Electrochemical Thermodynamics: Efficiency and Potentials
Explores electrochemical thermodynamics, efficiency, potentials, and their practical applications in fuel cells and non-standard conditions.
Environmental Impact and Efficiency
Delves into environmental impact, efficiency, IPAT formula, Kaya decomposition, decoupling, and rebound effect in various sectors.
Relations Between Events
Log in to Mediaspace to watch this video
Explores relations between events, disjunctive constraints, and modeling with binary variables in optimization problems.
Minimum Spanning Trees
Log in to Mediaspace to watch this video
Covers the implementation and analysis of disjoint sets data structure and introduces the concept of minimum spanning trees.
Integer Programming and Network Flows
Log in to Mediaspace to watch this video
Covers the fundamentals of integer programming and network flows in directed graphs.
Previous
Page 1 of 2
Next
