Přehled a implementace vybraných algoritmů používaných pro dělení grafů.

Abstract

This master thesis is deals with the topic of graph partitioning algorithms. Nowadays, the issue of algorithms is relevant especially in transport, social networks and many industrial sectors. The thesis aims to familiarize the readers with the different types of algorithms used for graph partitioning, implementation of selected types of these algorithms and the test of their time requirements and quality division. These results are then compared with the results from the METIS.