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
Graph Coloring: Theory and Applications
Graph Chatbot
Related lectures (29)
Previous
Page 3 of 3
Next
Graph Coloring and Directed Cycles
Explores graph coloring, directed cycles, LLL algorithm applications, and element dependencies in graphs.
Markov Chains and Algorithm Applications
Covers the fundamentals of Markov chains and their applications in algorithms, focusing on proper coloring and the Metropolis algorithm.
Max Sum Diversification
Explores maximizing diversity in document selection, graph clique determination, theorems on negative type, and convex optimization.
Solving Parity Games in Practice
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Markov Chains and Algorithm Applications
Covers Markov chains and their applications in algorithms, focusing on Markov Chain Monte Carlo sampling and the Metropolis-Hastings algorithm.
Cheeger's Inequalities
Explores Cheeger's inequalities for random walks on graphs and their implications.
Sparsest Cut: ARV Theorem
Covers the proof of the Bourgain's ARV Theorem, focusing on the finite set of points in a semi-metric space and the application of the ARV algorithm to find the sparsest cut in a graph.
Graph Sketching: Connected Components
Covers the concept of graph sketching with a focus on connected components.
Dynamic Programming: Pascal's Triangle & Floyd's Algorithm
Explores dynamic programming through Pascal's Triangle and Floyd's Algorithm.
