Graphs and their Applications

Course code: 128GA10
Course guarantor: --
Form of exams: EX
Number of credits: 4 credits
Weekly load: 2+0

Abstract	(semestr )
Fundamentals of graph theory. Emphasis is laid on basic concepts, applications and algorithms. From the contents: connectivity, strong conectivity, trees, shortest paths, flows in networks, Eulerian and Hamiltonian paths, colorings, independent sets, planar graphs.
Content
baslic terminology of graph theory graph modelling of real world problems Search algorithms, connectivity and strong connectivity, acyclic graphs, topological sort, trees and spanning trees, shortest paths flows in networks, matching, assignment problem hamiltonian problems coloring, independent sets, cliques planar graphs
Literature
[1] Diestel, R.: Graph Theory, Springer, 1996, [2] Swamy, M., N., S., Thulasiraman, K., Graphs, Networks and Algorithms. New York, John Wiley&Sons, Inc., 1981. [3] Demel, J.: Graphs and their Applications, (internal material).
Prerequisities
--
Studijní plány
--