Logo ČVUT
Loading...
CZECH TECHNICAL UNIVERSITY IN PRAGUE
STUDY PLANS
2011/2012

Graph Theory

Login to KOS for course enrollment Display time-table
Code Completion Credits Range Language
11Y1TG KZ 2 2+0 Czech
Lecturer:
Jiří Taufer (gar.)
Tutor:
Jiří Taufer (gar.)
Supervisor:
Department of Applied Mathematics
Synopsis:

Simple graphs, multigraphs, labelled graph, planar graph, Euler´s formula. Euler Circuit, Hamilton circuit and directed graphs. Algorithms for finding distances in digraphs - Dijkstra´s algorithm. Weighted graphs, shortest paths and minimal spanning trees. A depth first spanning tree, a breadth first spanning tree. Adjacency matrices. Flows in networks.

Requirements:

knowledge of basic concepts of graph theory

Syllabus of lectures:
Syllabus of tutorials:
Study Objective:

Knowledge of theoretical approach to a variety of applications and problems in the area of communications. Focus on transportation networks.

Study materials:

Šišma P, Teorie grafů 1736 - 1963, Prometheus, 1977

Tuzar A., Maxa P., Svoboda V., Teorie dopravy, Praha, skriptum FD ČVUT, 1997

Kučera L., Kombinatorické algoritmy, Praha, SNTL, 1989, Nečas J., Grafy a jejich použití, Praha, SNTL, 1978

Note:
Time-table for winter semester 2011/2012:
Time-table is not available yet
Time-table for summer semester 2011/2012:
Time-table is not available yet
The course is a part of the following study plans:
Generated on 2012-7-9
For updated information see http://bilakniha.cvut.cz/en/predmet24063405.html