Basic concepts and terminology of graph theory, graph representation. Problems of graph theory, problem instance. Graph search algorithms, trees, minimum spanning tree, shortest path problem, Eulerian path, bipartite graph matching, flow networks, circulations, critical path method, traveling salesman problem. Problem of existence and optimization and algorithms for their solving. Computational complexity, dealing with NP-complete problems, heuristic approach.
Objectives:
Deeper understanding of graph theory basics. Learning of bacis concepts and problems in the field of algoritmization. Classical problems of graph theory and algorithms for their solving. Introducing to time complexity and efficiency of algorithms.