PB165 Graphs and networks

Faculty of Informatics
Autumn 2009
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
Tue 10:00–11:50 D2
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
there are 24 fields of study the course is directly associated with, display
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.
Graduate will be able to explain several graph algorithms and their use in computer systems and networks.
Graduate will be able to analyze particular problem and transform it into appropriate graph representation.
Graduate will be further able to analyze and solve simple scheduling and planning problems.
Graduate will be able to solve simple graph problems.
Graduate will be able to interpret computer network behavior in terms of graph theory.
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 problems and their graph representation.
  • Project scheduling and critical path method.
  • Graph colouring and timetabling.
  • Data transfer planning.
  • List scheduling, mapping heuristics, clustering.
  • Load balancing.
  • 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
Teaching methods
Standard lecture, no drills, no homeworks. Lectures include exercises.
Assessment methods
No evaluation during the semester, only final written exam (9 questions, 100 points). There is following evaluation A 100-90, B 89-80, C 79-70, D 69-60, E 59-55. For completion of a course, it is necessary to have base knowledge from all three areas of the course -- base graph algorithms, planning and scheduling in graphs and networks, graph algorithms in computer networks.
Language of instruction
Czech
Further Comments
Study Materials
The course is taught annually.
The course is also listed under the following terms Autumn 2007, Autumn 2008, Autumn 2010, Autumn 2011, Autumn 2012, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2016, Autumn 2017, Autumn 2018, Autumn 2019.
  • Enrolment Statistics (Autumn 2009, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2009/PB165