Subjects

Your browser does not support JavaScript, or its support is disabled. Some features may not be available.

Algorithms for Specific Graph Classes - NDMI077

Title:	Algoritmy pro specifické třídy grafů
Guaranteed by:	Department of Applied Mathematics (32-KAM)
Faculty:	Faculty of Mathematics and Physics
Actual:	from 2024
Semester:	summer
E-Credits:	3
Hours per week, examination:	summer s.:2/0, Ex [HT]
Capacity:	unlimited
Min. number of students:	unlimited
4EU+:	no
Virtual mobility / capacity:	no
State of the course:	taught
Language:	English, Czech
Teaching methods:	full-time

Guarantor:	doc. RNDr. Jiří Fiala, Ph.D.
Teacher(s):	doc. RNDr. Jiří Fiala, Ph.D.
Class:	Informatika Mgr. - volitelný
Classification:	Informatics > Discrete Mathematics

Opinion survey results Examination dates Noticeboard

Annotation -

Special course for advanced undergraduate and graduate students devoted to algorithm design for restricted graph classes.

Last update: Macharová Dana, JUDr. (14.10.2008)

Literature -

This lecture is NOT BEING TAUGHT in the summer term 2021/22.

Diestel, R.: Graph Theory, graduate texts in mathematics, vol. 173., Springer Verlag, May 1997.

Kloks, T. Treewidth: Computations and approximations, no. 842 in Lecture Notes in Computer Science, Springer Verlag, 1994.

Časopisecká literatura podle specifikace přednášejícího.

Last update: Šámal Robert, doc. Mgr., Ph.D. (20.12.2021)

Syllabus -

In the course will be shown desing of effective algorithms for NP-hard problems on graphs of bounded treewidth. Some other graph classes (e.g. intersection graphs) will also be considered.

Last update: Macharová Dana, JUDr. (14.10.2008)