|
|
Graph Drawing: Visualisation and Geometric Representations of Graphs and Networks
Vyskočil, Tomáš ; Kratochvíl, Jan (advisor) ; Felsner, Stefan (referee) ; Kaiser, Tomáš (referee)
Title: Graph Drawing: Visualization and Geometric Representations of Graphs and Networks Author: Tomáš Vyskočil Department: Department of applied mathematics Supervisor: Prof. RNDr. Jan Kratochvíl, CSc., KAM Abstract: This thesis is devoted to studying of representations of graphs. In Chapters 2-4 we study intersection graphs in the plane. In Chapter 5 we consider problems of modifications of graphs. Regarding intersection graphs, we prove that all complements of partial 2- trees are intersection graphs of segments. We show complexity of recognition of intersection graphs of path in the grid with bounded number of bends and intersection graphs of connected regions (we call them islands) in the extended grids. In the part devoted to modification problems we present a fixed-parameter tractable (FPT) algorithm which answers the question whether a given graph can be made planar with at most k contractions and we also provide gener- alization of this problem. Keywords: graph theory, graph representations, combinatorics
|
|
|
Web Conference Calendar
Pokorný, Petr ; Vyskočil, Tomáš (advisor) ; Zavoral, Filip (referee)
A scientific article can only be submitted to one conference. The purpose of this work is to create a web application which will aid in determining where a given article can still be submitted, using mainly a graphical diagram. The text itself first provides a detailed specification of the problem, then it discusses the choice of individual technologies and the general implementation approach. The following section then briefly describes some implementation details and suggests areas for expansion of the project. The last chapter is dedicated to technical and licensing considerations. The result of the work is a working web application designed for use in academic circles and for further refinement.
|
|
|
The testing of soccer strategy
Fiklík, Vladimír ; Vyskočil, Tomáš (advisor) ; Plch, Tomáš (referee)
The aim of this work is to create a system for testing and simulating soccer strategies. The task for the user is to write a strategy which describes a behavior of soccer players during the game. The strategy is written in a script in Scheme programming language. During the game the script is used to control soccer players. The second part of this work is to write a script for an intelligent opponent (in the Scheme language).
|
|
| |
|
|
Bidirectional heuristic search
Hřebejk, Tomáš ; Vyskočil, Tomáš (advisor) ; Zajíček, Ondřej (referee)
The purpose of this bachelor thesis is to summarize the most important results on bidirectional heuristic search and to bring some new thoughts. Two algorithms are described which attempt to improve the best algorithms in this field. The algorithms were experimentally compared with a unidirectional algorithm. According to the result of the comparison, we can state that bidirectional heuristic algorithms can be much faster than unidirectional heuristic algorithms. The text also describes how to solve some problems by shortest-path algorithms and how to make a good heuristic. A program which can solve a generalized puzzle was created as a demonstration.
|
|
|
Graph Drawing: Visualisation and Geometric Representations of Graphs and Networks
Vyskočil, Tomáš ; Kratochvíl, Jan (advisor) ; Felsner, Stefan (referee) ; Kaiser, Tomáš (referee)
Title: Graph Drawing: Visualization and Geometric Representations of Graphs and Networks Author: Tomáš Vyskočil Department: Department of applied mathematics Supervisor: Prof. RNDr. Jan Kratochvíl, CSc., KAM Abstract: This thesis is devoted to studying of representations of graphs. In Chapters 2-4 we study intersection graphs in the plane. In Chapter 5 we consider problems of modifications of graphs. Regarding intersection graphs, we prove that all complements of partial 2- trees are intersection graphs of segments. We show complexity of recognition of intersection graphs of path in the grid with bounded number of bends and intersection graphs of connected regions (we call them islands) in the extended grids. In the part devoted to modification problems we present a fixed-parameter tractable (FPT) algorithm which answers the question whether a given graph can be made planar with at most k contractions and we also provide gener- alization of this problem. Keywords: graph theory, graph representations, combinatorics
|
|
| |
|
|
Web Conference Calendar
Pokorný, Petr ; Vyskočil, Tomáš (advisor) ; Zavoral, Filip (referee)
A scientific article can only be submitted to one conference. The purpose of this work is to create a web application which will aid in determining where a given article can still be submitted, using mainly a graphical diagram. The text itself first provides a detailed specification of the problem, then it discusses the choice of individual technologies and the general implementation approach. The following section then briefly describes some implementation details and suggests areas for expansion of the project. The last chapter is dedicated to technical and licensing considerations. The result of the work is a working web application designed for use in academic circles and for further refinement.
|
|
|
Bidirectional heuristic search
Hřebejk, Tomáš ; Vyskočil, Tomáš (advisor) ; Zajíček, Ondřej (referee)
The purpose of this bachelor thesis is to summarize the most important results on bidirectional heuristic search and to bring some new thoughts. Two algorithms are described which attempt to improve the best algorithms in this field. The algorithms were experimentally compared with a unidirectional algorithm. According to the result of the comparison, we can state that bidirectional heuristic algorithms can be much faster than unidirectional heuristic algorithms. The text also describes how to solve some problems by shortest-path algorithms and how to make a good heuristic. A program which can solve a generalized puzzle was created as a demonstration.
|
|
|
Trunk ortheses and their application in the treatment of scoliosis
Čáková, Marcela ; Šamánková, Marie (advisor) ; Vyskočil, Tomáš (referee)
People with the spinal column deformity are first time mentioned already in the times of ancient civilizations, about 3500 years' BC. Those people were mostly proscribed from the common society. Hippocrates was the first who described scoliosis as an illness. The scoliosis is a pathological space curvature of the spine to right or left side in the frontal plane. It is very often accompanied with the rotation of vertebras. Structural scoliosis is a fixed lateral (sideway) curve of the spine. It is conditioned by structural changes of the vertebras body, its rotation and the vertebras parts asymmetry. Nonstructural scoliosis hasn't got anatomical basis of its origin in the spine itself. The vertebras aren't deformed. It's caused by underlying condition such as difference in leg length. Treatment of scoliosis is often provided by conservative methods such as body brace and rehabilitation. If there is a high progression of scoliosis curve - an operative treatment is indicated. I've made a survey in the subject of "spinal braces and their use in scoliosis treatment." I've been visiting a working place where the spinal braces are made. They allowed me to communicate with patients. I've prepared a questionnaire which included seventeen questions. Thanks to it I've discovered that most of the respondents are women...
|
guest ::
