PřF:M5100 Graphs and networks - Course Information
M5100 Graphs and networks
Faculty of ScienceAutumn 2001
- Extent and Intensity
- 2/1/0. 5 credit(s). Type of Completion: zk (examination).
- Teacher(s)
- doc. RNDr. Josef Niederle, CSc. (lecturer)
- Guaranteed by
- doc. RNDr. Josef Niederle, CSc.
Department of Mathematics and Statistics – Departments – Faculty of Science
Contact Person: doc. RNDr. Josef Niederle, CSc. - 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
- Mathematics - Economics (programme PřF, M-AM)
- Mathematics (programme PřF, B-MA)
- Course objectives
- Graphs and their particular cases. Representation of graphs.
Factors and subgraphs.
Paths and circuits.
Connectivity and components.
Forests and trees. Isomorphism of trees.
Minimal spanning trees.
Connected components.
Shortest and longest paths.
Critical path method.
Widest paths.
Maximal flow trough networks. - Literature
- KUČERA, Luděk. Kombinatorické algoritmy. 2., nezměn. vyd. Praha: SNTL - Nakladatelství technické literatury, 1989, 286 s. info
- NEŠETŘIL, Jaroslav. Kombinatorika. Vyd. 1. Praha: Státní pedagogické nakladatelství, 1983, 173 s. URL info
- NEŠETŘIL, Jaroslav. Teorie grafů. Vyd. 1. Praha: SNTL - Nakladatelství technické literatury, 1979, 316 s. URL info
- PLESNÍK, Ján. Grafové algoritmy. Vyd. 1. Bratislava: VEDA, vydavateľstvo Slovenskej akadémie vied, 1983, 343 s. info
- WALTER, Jaromír, Stanislav VEJMOLA and Petr FIALA. Aplikace metod síťové analýzy v řízení a plánování. 1. vyd. Praha: SNTL - Nakladatelství technické literatury, 1989, 282 s. ISBN 80-03-00101-3. info
- Language of instruction
- Czech
- Further Comments
- The course can also be completed outside the examination period.
The course is taught annually.
The course is taught: every week.
- Enrolment Statistics (recent)
- Permalink: https://is.muni.cz/course/sci/autumn2001/M5100