Teachings

This course is an introduction to the theory of graphs intended for students of mathematics and other sciences. The course introduces in an elementary way some basic knowledge and
primary methods in graph theory. We start from basic definitions and examples, but hope to move on quickly and cover a broad range of topics.

The objective is to provide a solid foundation in algorithm design and analysis. Specifically, the learning outcomes
include: ability to understand and design algorithms using greedy strategy, divide and conquer approach, dynamic
programing ability to analyze asymptotic runtime complexity of algorithms including formulating recurrence relations basic knowledge of computational complexity and randomized algorithms.