|
|
Graphics Graph Representation
Matula, Radek ; Goldefus, Filip (referee) ; Masopust, Tomáš (advisor)
This Master Thesis deals with the drawing algorithms of graphs known from the mathematical theory. These algorithms deals with an appropriate distribution of the graph vertices in order to obtain the most clear and readable graphs for human readers. The main objective of this work was also to implement the drawing algorithm in the application that would allow to edit the graph. This work deals also with graphs representation in computers.
|
|
|
Advanced epidemic models and their analysis
Skácelová, Radka ; Šremr, Jiří (referee) ; Čermák, Jan (advisor)
This diploma thesis analyzes several SIR epidemiological models which are described by a system of non-linear differental equations; it is mainly focused on SIR models with biths and deaths describing long-term epidemics. The goal of this thesis is to develop and analyze models with a time delay, and to extend some of the studied models using the graph theory, find their stationary states and analyze their stability. The thesis is particularly focused on spatially heterogenous stationary states for special types of graphs - complete graphs, stars and cycles.
|
|
|
Advanced epidemic models and their analysis
Skácelová, Radka ; Šremr, Jiří (referee) ; Čermák, Jan (advisor)
This diploma thesis analyzes several SIR epidemiological models which are described by a system of non-linear differental equations; it is mainly focused on SIR models with biths and deaths describing long-term epidemics. The goal of this thesis is to develop and analyze models with a time delay, and to extend some of the studied models using the graph theory, find their stationary states and analyze their stability. The thesis is particularly focused on spatially heterogenous stationary states for special types of graphs - complete graphs, stars and cycles.
|
|
|
Graphics Graph Representation
Matula, Radek ; Goldefus, Filip (referee) ; Masopust, Tomáš (advisor)
This Master Thesis deals with the drawing algorithms of graphs known from the mathematical theory. These algorithms deals with an appropriate distribution of the graph vertices in order to obtain the most clear and readable graphs for human readers. The main objective of this work was also to implement the drawing algorithm in the application that would allow to edit the graph. This work deals also with graphs representation in computers.
|
guest ::
