Graph Algorithms

The website is continuously updated.

Obsah:

2019/2020 -- Thursday 11:00-13:50, Room E104

Three-hour lecture usually consists of lecturing (approx. 2 hours) and demonstrational exercises (approx. 1 hour). Both, by Zbyněk Křivka.

The detailed information will be given at the first/second lecture. The students register for the project in WIS (IS FIT).

Graph Theory (wikipedia)
Graph Theory (book by Reinhard Diestel)
A polynomial 3-coloring solver with proofs
Algovize (demonstration of algorithms for minimum spanning trees, network flows, shortests paths and some non-graph algorithms such as sorting algorithms); Text for Algovision (EN, too)
Algorithm Animations and Visualizations (the collection of classical graph and non-graph algorithms)
Algorithm Design (slides) (the collection of slides and supporting materials for book J. Kleinberg, É. Tardos: Algorithm Design, Addison-Wesley, 2006)

Demonstration application of selected graph algorithms (Katarína Galanská) - modular Java application with GUI (version 2018-05-28)
Maximal flow/minimum cut in Networks (Benjamin Makovský)

No history yet!