Problemas de otimização combinatória para união explícita de arestas
Nenhuma Miniatura disponível
Data
2018-03-21
Autores
Título da Revista
ISSN da Revista
Título de Volume
Editor
Universidade Federal de Goiás
Resumo
Edge bundling is a technique to group, align, coordinate and position the depiction of edges in a graph
drawing, so that sets of edges appear to be brought together into shared visual structures, i.e. bundles. The
ultimate goal is to reduce clutter to improve how it conveys information. This thesis provides a general
formulation for the explicity edge bundling problems, as a formal combinatorial optimization problem. This
allows for the definition and comparison of edge bundling problems. In addition, we present four explicity
edge bundling optimization problems that address minimizing the total number of bundles, in conjunction
with other aspects, as the main goal. An evolutionary edge bundling algorithm is described. The algorithm
was successfully tested by solving three related problems applied to real-world instances. The reported
experimental results demonstrate the effectiveness and the applicability of the proposed evolutionary
algorithm to help resolve edge bundling problems formally defined as optimization models.
Descrição
Citação
FERREIRA, Joelma de Moura. Problemas de otimização combinatória para união explícita de arestas. 2018. 191 f. Tese (Doutorado em Ciência da Computação em Rede) - Universidade Federal de Goiás, Goiânia, 2018.