Các tùy biến ghi danh

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:
doc. PaedDr. Milan Pokorný, PhD. - Zabezpečuje, Vedúci semináru, Skúšajúci, Kogarant, Prednášajúci, Zodpovedný za elearning, Cvičiaci
prof. Ing. Veronika Stoffová, CSc. - Zabezpečuje, Hlavný garant

Code: XMIB130

Period: ZS

Credits: 3

Khách không thể truy cập khóa học này, làm ơn đăng nhập.