Wyniki wyszukiwania - BazTech

Ograniczanie wyników

Znaleziono wyników: 4

Liczba wyników na stronie

Wyniki wyszukiwania

Wyszukiwano:
w słowach kluczowych: teoria grafu

Sortuj według:

Ogranicz wyniki do:

Wykorzystanie teorii grafów w procedurze szacowania potencjału energetycznego biomasy

Duczkowska-Kądziel A.

Zeszyty Naukowe. Mechanika / Politechnika Opolska

2009

z. 93

27--28

In the paper an opportunity of adding to the algorithm of the evaluation an analyses of finding optimal route of transport the biomass in the example of the chosen province has been presented. As a result of calculation of the algorithm, a Minimum Spanning Tree (MST) has been found which is the sum of the weights of the edges rep- resenting the routes joining the towns.

Parallel tabu search for graph coloring problem

Dąbrowski J., Kubale M.

Prace Naukowe Politechniki Warszawskiej. Elektronika

2006

z. 156

87-95

Tabu search is a simple, yet powerful meta-heuristic based on local search that has been often used to solve combinatorial optimization problems like the graph coloring problem. This paper presents current taxonomy of parallel tabu search algorithms and compares three parallelization techniques applied to Tabucol, a sequential TS algorithm for graph coloring. The experirnental results are based on graphs available from the DIMACS benchmark suite.

Evolutionary approach to constrained minimum spanning tree problem - commercial software based application

Pagacz A., Raidl G., Zawiślak S.

Prace Naukowe Politechniki Warszawskiej. Elektronika

2006

z. 156

331-341

The constrained minimum spanning tree problem is considered in the paper. We assume that the degree of any vertex should not exceed a particular constraint d. In this formulation the problem turns into NP-hard one, therefore the evolutionary approach is applicable. The edge set representation of a chromosome was utilized for a tree in the algorithm. The evolutionary algorithm was worked out and the related computer program has been written. Interfaces between the core program and MS Visio as well as the data base system were prepared. The results obtained by means of the system are shown.

Evolutionary algorithm to find graph covering subsets using α-cliques

Potrzebowski H., Stańczak J., Sęp K.

Prace Naukowe Politechniki Warszawskiej. Elektronika

2006

z. 156

351-358

The article describes a new evolutionary based method to divide graph into strongly connected structures we called α-cliques. The α-clique is a generalization of a clique concept with the introduction of parameter a. Using this parameter it is possible to control the degree (or strength) of connections among vertices (nodes) of this sub-graph structure. The evolutionary approach is proposed as a method that enables to find separate a-cliques that cover the set of graph vertices.