M6502p Diskrétní matematika II

Faculty of Science
Spring 2000
Extent and Intensity
2/0/0. Type of Completion: zk (examination).
Teacher(s)
doc. RNDr. Eduard Fuchs, CSc. (lecturer)
Guaranteed by
doc. RNDr. Eduard Fuchs, CSc.
Departments – Faculty of Science
Contact Person: doc. RNDr. Eduard Fuchs, CSc.
Course Enrolment Limitations
The course is offered to students of any study field.
Syllabus
  • Elements of graph theory. Connected graphs, trees. Eulerian and Hamiltonian graphs and their applications (with respect to educational mathematics). Planar graphs, graph colouring. Elemnetary graph algorithms: shortest paths, minimal spanning trees, critical paths. Characterisation of NP-complete problems; the traveling salesman problem.
Language of instruction
Czech
Further Comments
The course is taught annually.
The course is taught: every week.
  • Enrolment Statistics (recent)
  • Permalink: https://is.muni.cz/course/sci/spring2000/M6502p