Algorithms and Complexity – Graph Theory

The "Algorithms and Complexity – Graph Theory" course involves studying graph theory in the context of algorithms and computational complexity. Students delve into the study of structures and algorithms of graph models, which are widely applied in computer science and other fields such as networking, bioinformatics, and data analysis. The course covers fundamental concepts and theorems of graph theory, such as paths, cycles, trees, connectivity, as well as various types of graphs and their representations. Students learn various algorithms for working with graphs, including traversals, shortest path algorithms, minimum spanning tree algorithms, and others. Additionally, the course discusses issues of computational complexity and algorithmic optimization in the context of graph problems. Upon completing the course, students acquire fundamental knowledge and skills for solving diverse problems related to the analysis and processing of graph structures.