Solving Parity Games in PracticeExplores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Max Sum DiversificationExplores maximizing diversity in document selection, graph clique determination, theorems on negative type, and convex optimization.
DFS Continuation: Topological SortCovers topics like DFS output, edge classification, acyclic graphs, correctness, time analysis, SCCs, and the Topological Sort algorithm.
Introduction to Shortest PathIntroduces the concept of shortest path, discussing weighted paths, Hamiltonian paths, and path optimization algorithms.
Complexity Classes: P and NPExplores complexity classes P and NP, highlighting solvable and verifiable problems, including NP-complete challenges.
Prim's and Kruskal's AlgorithmsExplores Prim's and Kruskal's algorithms for finding minimum spanning trees in a graph, covering their correctness, implementation, and analysis.
Optimization AlgorithmsCovers optimization algorithms, convergence properties, and time complexity of sequences and functions.
