Explores practical aspects of solving parity games, including winning strategies, algorithms, complexity, determinism, and heuristic approaches.
Explores handling network data, including types of graphs, real-world network properties, and node importance measurement.
Covers the fundamentals of graph theory, including vertices, edges, degrees, walks, connected graphs, cycles, and trees, with a focus on the number of edges in a tree.
Covers approximation algorithms for optimization problems, LP relaxation, and randomized rounding techniques.
Covers the Simplex algorithm for function minimization with linear constraints.
