Redukce bezeškálových grafů pomocí rojové inteligence

Abstract

The diploma thesis is focused on implementation of algorithm, which reduces scale free graphs using swarm inteligennce. For a swarm inteligence in this thesis was choosed ant colony algorithm. In this text you can find evolution of scale free graphs, their properties and a chapter about classic graph reduction techniques, which are considered as a current trend of graph reduction. The next part is focusing on description of ant algorithm and design of implemented algorithm. In experimental part of this thesis there will be presented results of graph reduction using implemented ant algorithm and after that they will be analysed to evaluate suitability of implemented algorithm for solving a problém of graph reduction