Thesis Details

Využití dynamického programování v grafových algoritmech

Bachelor's Thesis Student: Biloš Martin Academic Year: 2018/2019 Supervisor: Burgetová Ivana, Ing., Ph.D.
English title
Dynamic Programming in Graph Algorithms
Language
Czech
Abstract

This work is about graph algorithms, their use and the benefit of the optimization method of dynamic programming. This benefit is show to the user via the graphic application. Graph algorithms find use in many sectors of human activity. They are used in packet routing or, for example, navigation.There are three methods of graph algorithms used in this work. This problems are solved with classic and dynamic way and measured data are compared.

Keywords

Dynamic programming, C++, gtkmm, optimalization, graph, shortest path, traveling salesman, hidden markov model, Viterbi algorithm

Department
Department of Information Systems FIT BUT
Degree Programme
Information Technology
Files
Status
defended, grade D
Date
10 June 2019
Reviewer
Křivka Zbyněk, Ing., Ph.D.
Committee
Kolář Dušan, doc. Dr. Ing. (DIFS FIT BUT), předseda
Burgetová Ivana, Ing., Ph.D. (DIFS FIT BUT), člen
Černocký Jan, prof. Dr. Ing. (DCGM FIT BUT), člen
Peringer Petr, Dr. Ing. (DITS FIT BUT), člen
Vašíček Zdeněk, doc. Ing., Ph.D. (DCSY FIT BUT), člen
Citation
BILOŠ, Martin. Využití dynamického programování v grafových algoritmech. Brno, 2019. Bachelor's Thesis. Brno University of Technology, Faculty of Information Technology. 2019-06-10. Supervised by Burgetová Ivana. Available from: https://www.fit.vut.cz/study/thesis/22053/
BibTeX 
@bachelorsthesis{FITBT22053,
    author = "Martin Bilo\v{s}",
    type = "Bachelor's thesis",
    title = "Vyu\v{z}it\'{i} dynamick\'{e}ho programov\'{a}n\'{i} v grafov\'{y}ch algoritmech",
    school = "Brno University of Technology, Faculty of Information Technology",
    year = 2019,
    location = "Brno, CZ",
    language = "czech",
    url = "https://www.fit.vut.cz/study/thesis/22053/"
}

Theses

Back to top