Course detail

Graph Theory

FSI-VTG-KAcad. year: 2011/2012

The course provides an introduction to graph theory and familiarises students with basic terms.
It deals with the following topics: Graph representation. Time complexity of algorithms.
Data structures (binary heap, disjoint sets, ...). Eulearian trails, Hamiltonian paths.
Breadth-first searching, depth-first searching, backtracking, branch and bound method.
Connectivity and reachability. Shortest path problems (Dijkstra's algorithm, Floyd-Warshall algorithm). Network graphs. Trees, spanning tree problem, Steiner tree problems.
Fundamentals of computational geometry, Voronoi diagrams, Delaunay triangulation.
Network flows. Graph colouring. Graph matching.

Language of instruction

Czech

Number of ECTS credits

5

Mode of study

Not applicable.

Guarantor

prof. RNDr. Ing. Miloš Šeda, Ph.D.

Department

Institute of Automation and Computer Science (ÚAI)

Learning outcomes of the course unit

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

Prerequisites

Successful completion of the course "Graph Theory" is conditional on basic knowledge of set theory, combinatorics and operations research.

Co-requisites

Not applicable.

Planned learning activities and teaching methods

Teaching methods depend on the type of course unit as specified in the article 7 of BUT Rules for Studies and Examinations.

Assesment methods and criteria linked to learning outcomes

The course-unit credit is awarded on condition of having implemented a nontrivial graph algorithm using Delphi, or C++, etc. The exam has a written form and tests students’ knowledge of terms and fundamental algorithms.

Course curriculum

Not applicable.

Work placements

Not applicable.

Aims

The course aims to acquaint the students with the graph theory and graph-based algorithms that extend the knowledge acquired in courses focused on artificial intelligence, operations research, project management and computer networks and are commonly used to solve problems in engineering and other areas.

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

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

Recommended optional programme components

Not applicable.

Prerequisites and corequisites

Not applicable.

Basic literature

Cormen, T.H., Leiserson, C.E., Rivest, R.L. and Stein, C.: Introduction to Algorithms. MIT Press, 2001.
Gross, J.L. and Yellen, J.: Graph Theory and Its Applications. CRC Press, Boca Raton, 1998.
Gross, J.L. and Yellen, J.: Handbook of Graph Theory. CRC Press, Boca Raton, 2004.
Hochbaum, D.: Graph Algorithms and Network Flows. Lecture Notes, University of California at Berkeley, 1997, 84 pp.
Chartrand, G. and Oellermann, O.R. : Applied Algorithmic Graph Theory. McGraw Hill, New York, 1993.
Michaels, J.G. and Rosen, K.H.: Applications of Discrete Mathematics. McGraw Hill, New York, 1991.
Sedgewick, R.: Algorithms in Java, Part 5: Graph Algorithms. Addison Wesley, New York, 2002.

Recommended reading

Demel, J.: Grafy, , 0
Kolář, J.: Theoretical Computer Science , , 0
Plesník, J.: Grafové algoritmy, , 0

Classification of course in study plans

  • Programme N2301-2 Master's

    branch M-AIŘ , 2 year of study, winter semester, compulsory
    branch M-AIŘ , 2 year of study, winter semester, compulsory

Type of course unit

 

Guided consultation

17 hod., optionally

Teacher / Lecturer

prof. RNDr. Ing. Miloš Šeda, Ph.D.

Syllabus

1. Definition of a graph and basic terms.
2. Computer representation of a graph.
3. Time and space complexity of algorithms.
4. Graph searching, backtracking, branch and bound method.
5. Applications of path problems, shortest paths, network graphs.
6. Eulerian trails, Hamiltonian paths and circles.
7. Connected components, trees and spanning trees.
8. Steiner trees.
9. Voronoi diagrams, Delaunay triangulation.
10. Graph colouring, cliques.
11.-12. Network flows.
13. Graph matching.