FI:PB165 Graphs and networks - Course Information

PB165 Graphs and networks

Extent and Intensity

2/0. 2 credit(s) (plus extra credits for completion). Type of Completion: zk (examination).

Teacher(s)

prof. RNDr. Luděk Matyska, CSc. (lecturer)
doc. RNDr. Eva Hladká, Ph.D. (lecturer)
doc. Mgr. Hana Rudová, Ph.D. (lecturer)
RNDr. David Antoš, Ph.D. (assistant)
RNDr. Igor Peterlík, Ph.D. (assistant)

Guaranteed by

prof. RNDr. Václav Matyáš, M.Sc., Ph.D.
Department of Computer Systems and Communications – Faculty of Informatics

Timetable

Mon 14:00–15:50 A107

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

• Applied Informatics (programme FI, B-AP)
• Bioinformatics (programme FI, B-AP)
• Economic Information Systems (programme ESF, B-SI)
• Informatics with another discipline (programme FI, B-BI)
• Informatics with another discipline (programme FI, B-FY)
• Informatics with another discipline (programme FI, B-GE)
• Informatics with another discipline (programme FI, B-GK)
• Informatics with another discipline (programme FI, B-CH)
• Informatics with another discipline (programme FI, B-IO)
• Informatics with another discipline (programme FI, B-MA)
• Informatics with another discipline (programme FI, B-SO)
• Informatics with another discipline (programme FI, B-TV)
• Informatics (programme FI, B-IN)
• Mathematical Informatics (programme FI, B-IN)
• Parallel and Distributed Systems (programme FI, B-IN)
• Computer Graphics and Image Processing (programme FI, B-IN)
• Computer Networks and Communication (programme FI, B-IN)
• Computer Systems and Data Processing (programme FI, B-IN)
• Programmable Technical Structures (programme FI, B-IN)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-SS)
• Upper Secondary School Teacher Training in Informatics (programme FI, M-TV)
• Artificial Intelligence and Natural Language Processing (programme FI, B-IN)

Course objectives

The lecture provides basic information about graphs and graph algorithms, used in the computer networks. Special emphasis is taken to present planning and scheduling as specific graph problems, as well as the load distribution problem in distributed systems.

Syllabus

• Graph, directed and undirected graph, weighted graphs. Length in unweighted and weighted graph.
• Subgraph, isomorphic graphs.
• Trees, spanning tree. Networks and flows.
• Graph searching. Shortest path (Dijkstra's algorithm). Spanning tree algorithms. Maximum-flow algorithms.
• Planning and scheduling, project representation, critical path method.
• Shop scheduling, disjunctive graph representation, shifting bottleneck heuristic.
• Graph colouring problem and timetabling, graph colouring heuristics.
• Load balancing, graph representation, mapping heuristics.
• Switching and routing algorithms, GMS networks planning, peer to peer networks.

Literature

• Kocay, William. Graphs, algorithms, and optimization. Chapman \& Hall/CRC Press, 2005.
• GIBBONS, Alan. Algorithmic graph theory. Cambridge: Cambridge University Press, 1994, ix, 259. ISBN 0521288819. info
• PLESNÍK, Ján. Grafové algoritmy. 1. vyd. Bratislava: Veda, 1983, 343 s. info
• PINEDO, Michael. Planning and Scheduling in Manufacturing and Services. Springer, 2005. Springer Series in Operations Research. info

Language of instruction

Czech

Further Comments

Study Materials
The course is taught annually.

• Enrolment Statistics (Autumn 2007, recent)
  
• Permalink: https://is.muni.cz/course/fi/autumn2007/PB165