An Evolutionary Algorithm for an Optimization Model of Edge Bundling
This paper discusses three edge bundling optimization problems that aim to minimize the total number of bundles of a graph drawing, in conjunction with other aspects, as the main goal. A novel evolutionary algorithm for edge bundling for these problems is described. The algorithm was successfully te...
Main Authors: | Joelma de M. Ferreira, Hugo A. D. do Nascimento, Les R. Foulds |
---|---|
Format: | Article |
Language: | English |
Published: |
MDPI AG
2018-06-01
|
Series: | Information |
Subjects: | |
Online Access: | http://www.mdpi.com/2078-2489/9/7/154 |
Similar Items
-
Evolutionary offloading in an edge environment
by: Samah A. Zakaryia, et al.
Published: (2021-09-01) -
Inapproximability of the Edge-Contraction Problem
by: HIRATA, Tomio, et al.
Published: (2006) -
Effectively Tackling Reinsurance Problems by Using Evolutionary and Swarm Intelligence Algorithms
by: Sancho Salcedo-Sanz, et al.
Published: (2014-04-01) -
Similarity-Driven Edge Bundling: Data-Oriented Clutter Reduction in Graphs Layouts
by: Fabio Sikansi, et al.
Published: (2020-11-01) -
EF1-NSGA-III: An evolutionary algorithm based on the first front to obtain non-negative and non-repeated extreme points
by: Luis Felipe Ariza Vesga, et al.
Published: (2020-10-01)