National Repository of Grey Literature 2 records found  Search took 0.01 seconds. 
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.
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.

Interested in being notified about new results for this query?
Subscribe to the RSS feed.