Discrete Mathematics for Computer Science Students (XMIB130)

Course topics: Graphs. Basic concepts, adjacency matrix, graph representation, vertex degrees, vertex distance, contiguity, travel. Graph search algorithms. Independence and coverage. Eulerian graphs. Hamiltonian graphs. Planar graphs. Graph colouring. Trees, skeletons, binary trees. Graph algorithms. Applications in computer science.

Information sheet

Supervisors and educators:
prof. Ing. Veronika Stoffová, CSc. - Zabezpečuje, Hlavný garant
doc. PaedDr. Milan Pokorný, PhD. - Zabezpečuje, Prednášajúci, Cvičiaci, Skúšajúci, Kogarant, Zodpovedný za elearning, Vedúci semináru

Code: XMIB130

Period: ZS

Credits: 3