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 SS schedule 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 -

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: Fiala Jiří, doc. RNDr., Ph.D. (04.02.2025)

Syllabus -

This course focuses on the design of efficient algorithms for specific classes of graphs, for problems that are NP-hard in general. Namely, for graphs of different widths (tree decompositions - Courcelle's theorem, clique decompositions), of bounded degrees (Luks' isomorphism test), or with a given representation (intersection graphs of intervals, circles and other geometric objects).

The course is taught in the summer semester once every two years (alternates with NDMI059 - Graph Minors and Tree Decompositions).

Last update: Fiala Jiří, doc. RNDr., Ph.D. (04.02.2025)