Skip to main content
Skip header
Close

Searching

Graph algorithms

Graph algorithms
456-0097/01
čeština

Summary

This course covers graph algorithms and applications of
graph theory to computer systems.The algorithms are presented in a clear
algorithmic style, sometimes with considerable attention to data
representation.
Favourite algoritms:
Depth-first and breadth-first search, classical shortest-path alg., Dijkstra alg.,
topological oredering alg., coloring
and matching of graph (Edmonds matching alg.), network
flows.


Literature

Cormen, Leiserson, Rivest: Introduction to algorithms, MIT Press, 2001.
McHugh J. A.: Algorithmic graph theory, PRENTICE HALL, 1990.
Sedgewick R.: Bundle of Algorithms in Java, Third Edition (Parts 1-5): Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms, Addison-Wesley 2003.
Chartrand, Lesniak: Graphs & Digraphs, CRC Press 1996.

Advised literature

No advised literature has been specified for this subject.


back to search page
Language of instruction čeština
Code 456-0097
Abbreviation GRA
Course title Graph algorithms
Coordinating department Department of Computer Science
Course coordinator RNDr. Eliška Ochodková, Ph.D.