|
|
Graphs, Algorithms and their Application
Venerová, Lenka ; Dostál,, Jiří (referee) ; Bobalová, Martina (advisor)
The Bachelor thesis is primarily focused on the problems of graphs and graph algorithms. The main point is to explain and to enlarge the subject. Very often, we find ourselves confronted with problems, which we, though unconsciously, solve by means of the graph algorithms knowledge. Therefore, the other aim of my bachelor thesis is to demonstrate the application of some of these methods in solving distribution tasks.
|
|
|
Graph theory and its applications
Huclová, Alena ; Karásek, Jiří (referee) ; Pavlík, Jan (advisor)
It is often necessary to be oriented in the complicated relations between parts of a unit. This problem can be solved by the graphs’ theory very well. Graph G is an ordered pair (V,E) where V is a non-empty set of vertices (our parts of the unit) and E is a set of two-element subsets of the set V called arcs (i.e. relations between parts of the unit). G= (V,E) The graph aplication is frequently hidden. It is not found in the solution of the problem, but could be used to express and substantiate it quite easily. In my work I will deal with optimization problems of a graph. Problem of the maximum network flow that we solve using directed graph can be an example. As for non-directed graphs, we will be interested in the search of a minimum frame of a graph.
|
|
|
Graphs, Algorithms and their Application
Venerová, Lenka ; Dostál,, Jiří (referee) ; Bobalová, Martina (advisor)
The Bachelor thesis is primarily focused on the problems of graphs and graph algorithms. The main point is to explain and to enlarge the subject. Very often, we find ourselves confronted with problems, which we, though unconsciously, solve by means of the graph algorithms knowledge. Therefore, the other aim of my bachelor thesis is to demonstrate the application of some of these methods in solving distribution tasks.
|
|
|
Graph theory and its applications
Huclová, Alena ; Karásek, Jiří (referee) ; Pavlík, Jan (advisor)
It is often necessary to be oriented in the complicated relations between parts of a unit. This problem can be solved by the graphs’ theory very well. Graph G is an ordered pair (V,E) where V is a non-empty set of vertices (our parts of the unit) and E is a set of two-element subsets of the set V called arcs (i.e. relations between parts of the unit). G= (V,E) The graph aplication is frequently hidden. It is not found in the solution of the problem, but could be used to express and substantiate it quite easily. In my work I will deal with optimization problems of a graph. Problem of the maximum network flow that we solve using directed graph can be an example. As for non-directed graphs, we will be interested in the search of a minimum frame of a graph.
|
|
| |
guest ::
