|
|
|
||
Last update: G_I (26.10.2001)
|
|
||
Last update: doc. RNDr. Vít Jelínek, Ph.D. (10.06.2019)
Oral exam |
|
||
Last update: doc. RNDr. Vít Jelínek, Ph.D. (10.06.2019)
The exam is oral. The requirements correspond to the syllabus of the course, as covered by the lectures. |
|
||
Last update: doc. RNDr. Vít Jelínek, Ph.D. (10.06.2019)
Intersevtion graph classes: interval, chordal, circular arc, circle, permutation, comparability, segment, convex, and string graphs in the plane.
Characterisation results (interval, chordal, comparability and permutation graphs)
Recognition algorithms (chordal and comparability graphs). |