Course detail

Graphs and Algorithms

FSI-SGA-A Acad. year: 2024/2025 Winter semester

The course will provide students with basic concepts of the theory of graphs and with some algorithms based on that theory. After the basic definitions, the classic problems will be discussed including the Euler path and Hamilton cycle of a graph, vertex colouring, planar graphs etc. The next concept to be investigated will be trees and algorithms for a minimal spaning tree finding. Students will also learn about bipartite graphs, matching problem and shortest path problem. Direcdted graphs will also be discusses including algorithms for critical path finding. Finally, networks and flows in them will be deal with. The course will be oriented towards applications of graphs that can be found in many areas, particularly in technological sciences. Emphasis will be placed on applications in computer science, optimization, theory of control, and operation research.

Supervisor

prof. RNDr. Josef Šlapal, CSc.

Department

Institute of Mathematics

Learning outcomes of the course unit

Prerequisites

Planned learning activities and teaching methods

Assesment methods and criteria linked to learning outcomes

The course unit credit is awarded on condition of having attended the seminars actively and passed a written test. The exam has a written and an oral part. The written part tests student's ability to deal with various problems using the knowledge and skills acquired in the course. In the oral part, the student has ro prove that he or she has mastered the related theory.

 

The attendance at seminars is required and will be checked systematically by the teacher supervising the seminar. If a student misses a seminar, an excused absence can be cpmpensated for via make-up topics of exercises.

Language of instruction

English

Aims

The course aims to acquaint the students with the theory of graphs and graph-based algorithms, which are commonly used to solve problems in engineering and many other areas.

The students will be made familiar with the basics of the theory of graphs and graph algorithms. This will provide them with tools for using graphs to model various practical problems, which may then be solved by using the graph algorithms.

Specification of controlled education, way of implementation and compensation for absences

The study programmes with the given course

Programme N-AIM-A: Applied and Interdisciplinary Mathematics, Master's
branch ---: no specialisation, 4 credits, compulsory

Programme N-LAN-A: Logistics Analytics, Master's
branch ---: no specialisation, 4 credits, compulsory

Programme N-MAI-A: Mathematical Engineering, Master's
branch ---: no specialisation, 4 credits, compulsory

Programme N-MAI-P: Mathematical Engineering, Master's
branch ---: no specialisation, 4 credits, compulsory

Programme C-AKR-P: , Lifelong learning
branch CZS: , 4 credits, elective

Type of course unit

 

Lecture

26 hours, optionally

Teacher / Lecturer

Michael Joseph Lieberman, Ph.D.

Syllabus


  1. Basic con cepts

  2. Walks, paths and, cycles

  3. Trees and spanning trees

  4. Vertex coloring

  5. Planarity

  6. Sorting algorithms

  7. Shortest path problem

  8. Edge colouring

  9. Bipartite graphs

  10. Sorting

  11. Directed graphs

  12. Critical path problem

  13. Flows and Networks

Exercise

13 hours, compulsory

Teacher / Lecturer

Michael Joseph Lieberman, Ph.D.

Syllabus

Seminars will closely follow the lectures.