Graph Theory

Course Code:
11Y1TG
Academic Degree:
bachelor
Study Programme:
Technology in Transportation and Telecommunications (B 3710)
semesterlanguagestudy field / specialization
4czechall study fields
Form of Study:
full-time
Credits:
2
Number of Hours:
2 + 0 hours per week - in full-time study
Type of Course:
elective
Course Completion:
classified credit
Course Tutor:
 
roh  Lectures:
Mgr. Lucie Kárná, Ph.D.
Supervising Department:
Department of Applied Mathematics (16111)
Keywords:
Adjacency matrix, incidence matrix, minimal spanning tree, minimal path, bipartite graph, flow networks, algorithms.
Abstract:
Directed and undirected graphs, weighted graphs, matrices descripting graphs, minimal spanning tree, minimal path, Eulerian paths, graph traversing, matching in bipartite graphs, flow networks. Algorithms for problems of existence and optimization. Solving of NP-hard problems, heuristic approach.
Objectives:
Knowledge of a graph-theoretical approach to a variety of applications and problems in the field of transportation and logistic. Classic problems, focused on transportation networks. Introduction to algoritmization issues.