Algoritmos para problemas de grafos com incertezas / Algorithms for fuzzy graphs problems
AUTOR(ES)
Fabio Hernandes
DATA DE PUBLICAÇÃO
2007
RESUMO
The graph theory is an important area of mathematical programming, it has an important role in fields such as engineering and operational research. In particular, it provides the tools to tackle network problems (e.g. allocation, shortest path, maximum flow, etc), which have applications in several sub areas of engineering (e.g. telecommunications, transportation, manufacturing, etc). These applications can, however, possess uncertainties in their parameters or in their structure. Based on that, this work addresses some important applications of graph problems with uncertainties in their structure or parameters and proposes algorithms to find the solution to them. The applications studied are: shortest path problems, maximum flow problems, minimum cost flow problems and graph coloring problems. The uncertainties are modeled by means of the fuzzy sets theory, which has been successfully applied to problems with uncertainties and vagueness
ASSUNTO(S)
graphs theory grafos difusos algoritmos difusos conjuntos difusos fuzzy algorithms teoria de grafos fuzzy sets fuzzy graphs
