PB165 Graphs and networks

Faculty of Informatics
Autumn 2008
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 12:00–13: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 22 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.
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.
  • 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
Assessment methods
Course is concluded with the written exam.
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 2009, Autumn 2010, Autumn 2011, Autumn 2012, Autumn 2013, Autumn 2014, Autumn 2015, Autumn 2016, Autumn 2017, Autumn 2018, Autumn 2019.
  • Enrolment Statistics (Autumn 2008, recent)
  • Permalink: https://is.muni.cz/course/fi/autumn2008/PB165