Subject: Algorithms on Graphs

Aims of the subject:

The aim is to develop and increase logical and algorithmic thinking of students, to make them familiar with other concepts from the area of Graph-Theory and Combinatorial Algorithms (superstructure of the subject DIMA).

Moreover, in this subject students have to work up themselves on the given topic and introduce it within the exercises.

Subject matter:

Theory of Graphs

• Revision of the graph terminology
• Development of the graph terminology

Combinatorial Algorithms

• Various combinatorial Algorithms according to wish of students

Obligatory literature

Milková, E: study material prepared in electronic form in the virtual study environment WebCT (https://oliva.uhk.cz)

Recommended literature

Demel, J.: GRAFY a jejich aplikace, Academia, Praha, 2002

Matoušek, J.,Nešetřil, J.: Kapitoly z diskrétní matematiky, Karolinum, Praha, 2000

Milková, E.: Problém minimální kostry grafu, Gaudeamus, Hradec Králové, 2001

Kučera, L.:  Kombinatorické algoritmy. SNTL, Praha, 1989

Plesník, J.: Grafové algoritmy. VEDA Bratislava, 1983

Roberts, F. S., Tesman, B.: Applied Combinatorics, Second Edition, Pearson Prentice Hall, Upper Saddle River, NJ, 2004