|
|
Graph Isomorphism Problem in Databases
Stejskal, Roman ; Jirák, Ota (referee) ; Chmelař, Petr (advisor)
This project introduces history and basic notions of the graph theory. It describes graph theory problems, possible graph representations and practical graph management in databases. Aims to subgraph and graph isomorphism. It describes possible ways to find graph isomorphism and chosen algorithms for subgraph and graph isomorphism. The experimental part aims to comparing two implemented algorithms. These are Ullmann and VF2 algorithm. Also searches difference between graphs stored in memory and graphs stored in database.
|
|
|
Graphs and Its Methods in Databases
Hovad, Josef ; Zuzaňák, Jiří (referee) ; Jirák, Ota (advisor)
The thesis introduces the basic concepts of graph theory and graph representation both in mathematics and programming. Furthermore, it presents basic methods and problems of graphs searching and theory in general. There are presented graph data management capabilities of different database systems including those directly based on the graph theory. In the practical part, there is designed an efficient method of graphs traversing in PostgreSQL database. The method was tested and demonstrated by the graph search algorithms, coloring and isomorphism.
|
|
|
Automatic robot path planning tool
Rotrekl, Tomáš ; Zechmeister, Jaroslav (referee) ; Kadlec, Petr (advisor)
This bachelor’s thesis deals with the issue of robot path planning. The aim of the work is to get acquainted with the principles of robot path planning as is the creation of mazes with obstacles, expanding those obstacles, describing the environment of the maze, and using different ways to solve those mazes using the Dijkstra algorithm, A star algorithm, and the Variable Number of Dimensions Differential Evolution (VND-DE) algorithm. These algorithms are then implemented is independent toolbox created in programming language MATLAB. This tool allows as to create test tasks (mazes) and solve them using the mentioned algorithms.
|
|
|
Graph Isomorphism Problem in Databases
Stejskal, Roman ; Jirák, Ota (referee) ; Chmelař, Petr (advisor)
This project introduces history and basic notions of the graph theory. It describes graph theory problems, possible graph representations and practical graph management in databases. Aims to subgraph and graph isomorphism. It describes possible ways to find graph isomorphism and chosen algorithms for subgraph and graph isomorphism. The experimental part aims to comparing two implemented algorithms. These are Ullmann and VF2 algorithm. Also searches difference between graphs stored in memory and graphs stored in database.
|
|
|
Graphs and Its Methods in Databases
Hovad, Josef ; Zuzaňák, Jiří (referee) ; Jirák, Ota (advisor)
The thesis introduces the basic concepts of graph theory and graph representation both in mathematics and programming. Furthermore, it presents basic methods and problems of graphs searching and theory in general. There are presented graph data management capabilities of different database systems including those directly based on the graph theory. In the practical part, there is designed an efficient method of graphs traversing in PostgreSQL database. The method was tested and demonstrated by the graph search algorithms, coloring and isomorphism.
|
guest ::
