Desempenho do algoritmo guloso na coloração de vértices em grafos de sistemas complexos

• Main Author: Rogiski, Rosana
• Publication Date: 2016
• Format: Bachelor thesis
• Language: por
• Source: Repositório Institucional da UTFPR (da Universidade Tecnológica Federal do Paraná (RIUT))
• Download full: http://repositorio.utfpr.edu.br/jspui/handle/1/9220
• topic: Algorítmos; Teoria dos grafos; Programação heurística; Algorítmos computacionais; Algorithms; Computer algorithms; Graph theory; Heuristic programming; CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO::TEORIA DA COMPUTACAO::ANALISE DE ALGORITMOS E COMPLEXIDADE DE COMPUTACAO

In this work we aim to study the performance of greedy technique in the vertex coloring problem for graphs from Complex Systems. For doing that, twenty-five Complex Systems were selected, and from them we obtained the underlying graph on which the tests were performed. Two greedy heuristics for choosing the next vertex to be colored were analyzed: the first one uses the greatest degree heuristic for selecting the next vertex to be colored, and the second one applies the greatest saturation heuristic combined with the greatest degree heuristic. The results were compared with the optimal solution and some of the boundaries to the vertex coloring problem.