Introduces the basics of graph algorithms, covering traversal, representation, and data structures for BFS and DFS.
Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Explores learning from interconnected data with graphs, covering modern ML research goals, pioneering methods, interdisciplinary applications, and democratization of graph ML.
Covers finding the shortest path in directed graphs efficiently using algorithmic approaches and discussing related NP-complete problems.
