Problema de cobertura por vértices em redes complexas
Graph theory is a mathematical tool used in solving many algorithmic and computational problems in that both sets of model elements and relationships between these elements. Most natural and technological systems can be mathematically modeled by graph having many well known properties, in particular...
| Author: | |
|---|---|
| Format: | master thesis |
| Status: | Published version |
| Publication Date: | 2013 |
| Country: | Brasil |
| Institution: | Universidade Tecnológica Federal do Paraná (UTFPR) |
| Repository: | Repositório Institucional da UTFPR (da Universidade Tecnológica Federal do Paraná (RIUT)) |
| Language: | Portuguese |
| OAI Identifier: | oai:repositorio.utfpr.edu.br:1/734 |
| Online Access: | http://repositorio.utfpr.edu.br/jspui/handle/1/734 |
| Access Level: | Open access |
| Keyword: | Teoria dos grafos Algorítmos Otimização combinatória Complexidade computacional Computação Graph theory Algorithms Combinatorial optimization Computational complexity Computer science |
| Summary: | Graph theory is a mathematical tool used in solving many algorithmic and computational problems in that both sets of model elements and relationships between these elements. Most natural and technological systems can be mathematically modeled by graph having many well known properties, in particular the power law distribution of the vertex degree sequence. Examples of such graphs, called power law graphs are the Internet, World-Wide Web, social networks, biological networks. In the context of algorithmic problems on graphs, we are interested in problems in class NP-Hard, more specifically in the vertex cover problem. This work will be studied experimentally the behavior of an algorithm based on a greedy strategy for the vertex cover problem and compare with other approximation algorithms and with the exponential optimal solution. In particular this solution will be applied and analyzed in complex networks. |
|---|