PřF:M8160 Graph algorithms - Course Information

M8160 Graph algorithms

Extent and Intensity

2/1/0. 5 credit(s). Type of Completion: zk (examination).

Teacher(s)

doc. RNDr. Libor Polák, CSc. (lecturer)

Guaranteed by

doc. RNDr. Libor Polák, CSc.
Department of Mathematics and Statistics – Departments – Faculty of Science
Contact Person: doc. RNDr. Libor Polák, CSc.

Prerequisites (in Czech)

M5140 Combinatorics and graph theory

Course Enrolment Limitations

The course is also offered to the students of the fields other than those the course is directly associated with.

fields of study / plans the course is directly associated with

• Mathematics (programme PřF, M-MA, specialization Discrete Mathematics)
• Mathematics (programme PřF, N-MA, specialization Discrete Mathematics)

Syllabus

• Elementary graph algorithms (representations of graphs, breadth-first search, depth-first search, topological sort, strongly connected components). Minimum spanning trees ( growing a minimum spanning tree, the algorithms of Kruskal and Prim). Single-source shortest paths (shortest paths and relaxation, Dijkstra's algorithm, the Bellman-Ford algorithm, single-source shortest paths in directed acyclic graphs). All-pairs shortest paths (shortest paths and matrix multiplication, the Floyd-Warshall algorithm, Johnson's algorithm for sparse graphs). Maximum flow (flow networks, the Ford-Fulkerson method, maximum bipartite matching). Data structures for graph algorithms (binary heaps, priority queues, binomial heaps, data structures for disjoint sets).

Literature

• CORMEN, Thomas H., Charles Eric LEISERSON and Ronald L. RIVEST. Introduction to algorithms. Cambridge: MIT Press, 1990, xi, 1028. ISBN 0262031418. info

Language of instruction

Czech

Further Comments

The course is taught annually.
The course is taught: every week.

Teacher's information

http://www.math.muni.cz/~polak

• Enrolment Statistics (Spring 2000, recent)
  
• Permalink: https://is.muni.cz/course/sci/spring2000/M8160