|
|
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.
|
|
|
Preparation of Homeworks in the Course Algorithms
Miloš, Roman ; Masopust, Tomáš (referee) ; Lukáš, Roman (advisor)
This Bachelor's thesis is about preparing of homeworks for the course Algorithms on graphs. Thesis contains five parts. The first task is to create graphs using adjacency matrix, next is to create a graph using the adjacency lists. The third task is to implement Prim algorithm for finding the minimum skeleton. The fourth is the implementation of Floyd-Warshall algorithm for finding minimum paths in the graph, finding the connection and completeness of the graph. The fifth task is to identify and implement discretion chart NP-complete problem of finding a maximum clique of graph.
|
|
|
Impact of graph structures' features on the behaviour of the choosen distributed algorithm
Daňhel, Tomáš ; Škorpil, Vladislav (referee) ; Kenyeres, Martin (advisor)
The goal of this thesis is to describe the effect of the graph structures’ properties on the behavior of the chosen distributed algorithm. In the first part, I have described the theoretical concept and the behavior of the distributed algorithms. In the next part, I have focused my attention on describing the mathematical tools used to analyze the distributed algorithm. In the second part, I have focused on a detailed description of average consensus and wireless sensor networks. In the last part, we have presented the results of the practical experiments.
|
|
|
Impact of graph structures' features on the behaviour of the choosen distributed algorithm
Daňhel, Tomáš ; Škorpil, Vladislav (referee) ; Kenyeres, Martin (advisor)
The goal of this thesis is to describe the effect of the graph structures’ properties on the behavior of the chosen distributed algorithm. In the first part, I have described the theoretical concept and the behavior of the distributed algorithms. In the next part, I have focused my attention on describing the mathematical tools used to analyze the distributed algorithm. In the second part, I have focused on a detailed description of average consensus and wireless sensor networks. In the last part, we have presented the results of the practical experiments.
|
|
|
Impact of graph structures' features on the behaviour of the choosen distributed algorithm
Daňhel, Tomáš ; Škorpil, Vladislav (referee) ; Kenyeres, Martin (advisor)
The goal of this thesis is to describe the effect of the graph structures’ properties on the behavior of the chosen distributed algorithm. In the first part, I have described the theoretical concept and the behavior of the distributed algorithms. In the next part, I have focused my attention on describing the mathematical tools used to analyze the distributed algorithm. In the second part, I have focused on a detailed description of average consensus and wireless sensor networks. In the last part, we have presented the results of the practical experiments.
|
|
|
Preparation of Homeworks in the Course Algorithms
Miloš, Roman ; Masopust, Tomáš (referee) ; Lukáš, Roman (advisor)
This Bachelor's thesis is about preparing of homeworks for the course Algorithms on graphs. Thesis contains five parts. The first task is to create graphs using adjacency matrix, next is to create a graph using the adjacency lists. The third task is to implement Prim algorithm for finding the minimum skeleton. The fourth is the implementation of Floyd-Warshall algorithm for finding minimum paths in the graph, finding the connection and completeness of the graph. The fifth task is to identify and implement discretion chart NP-complete problem of finding a maximum clique of graph.
|
|
|
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 ::
